home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.compilers
- Path: sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!darwin.sura.net!paladin.american.edu!gatech!news.byu.edu!eff!world!iecc!compilers-sender
- From: bjornc@groucho.csd.uu.se (Bj|rn Carlson)
- Subject: Re: Building a Lattice
- Reply-To: bjornc@groucho.csd.uu.se (Bj|rn Carlson)
- Organization: Computing Science Department, Uppsala University, Sweden
- Date: Tue, 22 Dec 1992 19:33:41 GMT
- Approved: compilers@iecc.cambridge.ma.us
- Message-ID: <92-12-096@comp.compilers>
- References: <92-12-090@comp.compilers>
- Keywords: theory
- Sender: compilers-sender@iecc.cambridge.ma.us
- Lines: 31
-
- >>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
- 115-147
-
- >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
- >algorithm.
-
- 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.
-
- --
- Bjorn Carlson
- Computing Science Department
- Uppsala University
- Box 311 S-751 05
- Uppsala Sweden
-
- Bjorn.Carlson@csd.uu.se (bjornc@csd.uu.se, bjornc@sics.se)
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-