Efficient Implementation of Lattice Operations Export

@article{citeulike:4630, abstract = {Lattice operations such as greatest lower bound (GLB), least upper bound (LUB), and relative complementation (BUTNOT) are becoming more and more important in programming languages supporting object inheritance. We present a general technique for the efficient implementation of such operations based on an encoding method. The effect of the encoding is to plunge the given ordering into a boolean lattice of binary words, leading to an almost constant time complexity of the lattice operations. A...}, author = {Ait-Kaci, Hassan and Boyer, Robert S. and Lincoln, Patrick and Nasr, Roger}, citeulike-article-id = {4630}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.596}, journal = {Programming Languages and Systems}, keywords = {algorithms, data-structures, lattices}, number = {1}, pages = {115--146}, posted-at = {2004-12-23 02:19:22}, title = {Efficient Implementation of Lattice Operations}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.596}, volume = {11}, year = {1989} }

TY - JOUR ID - citeulike:4630 L3 - citeulike-article-id:4630 N2 - Lattice operations such as greatest lower bound (GLB), least upper bound (LUB), and relative complementation (BUTNOT) are becoming more and more important in programming languages supporting object inheritance. We present a general technique for the efficient implementation of such operations based on an encoding method. The effect of the encoding is to plunge the given ordering into a boolean lattice of binary words, leading to an almost constant time complexity of the lattice operations. A... IS - 1 JF - Programming Languages and Systems EP - 146 TI - Efficient Implementation of Lattice Operations VL - 11 SP - 115 KW - algorithms KW - data-structures KW - lattices AU - Ait-Kaci, Hassan AU - Boyer, Robert AU - Lincoln, Patrick AU - Nasr, Roger PY - 1989/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.596 ER -