|Building a Lattice email@example.com (1992-12-15)|
|Re: Building a Lattice chased@rbbb.Eng.Sun.COM (1992-12-18)|
|Re: Building a Lattice firstname.lastname@example.org (1992-12-19)|
|Re: Building a Lattice email@example.com (1992-12-22)|
|From:||firstname.lastname@example.org (Bj|rn Carlson)|
|Organization:||Computing Science Department, Uppsala University, Sweden|
|Date:||Tue, 22 Dec 1992 19:33:41 GMT|
>>Can anyone point me to an algorithm for building a lattice?
>Go grubbing around in copies of the JACM from the last two or three years.
The reference is:
"Efficient Implementation of Lattice Operations"
Hassan Ait-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr
ACM Transactions on Programming Languages and Systems
January 1989, vol 11, #1
>I happen to be specifically interested in a lattice whose meet is set
>intersection, whose join is set union, and whose partial ordering
>function is subset, but of course that shouldn't matter to the
The idea of the algorithm is that a set is encoded as a bit-vector,
where the coding maps meet and join to bitwise-and and bitwise-or.
The article also deals with compact encodings of sparse sets.
Computing Science Department
Box 311 S-751 05
Bjorn.Carlson@csd.uu.se (email@example.com, firstname.lastname@example.org)
Return to the
Search the comp.compilers archives again.