A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests
No abstract available.
DOI 10.1007/3-540-45337-7_10
Related papers
- Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies ECOOP 2002
- Efficient Type Inclusion Tests OOPSLA 1997
- Efficient Subtyping Tests with PQ-Encoding OOPSLA 2001
- Efficient subtyping tests with PQ-encoding TOPLAS 2005
- Poker: permutation-based SIMD execution of intensive tree search by path encoding CGO 2018
- Extensible encoding of type hierarchies POPL 2008
- Matching Multiplications in Bit-Vector Formulas VMCAI 2017
- A Fast Algorithm for Finding Dominators in a Flowgraph TOPLAS 1979