home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!sample.eng.ohio-state.edu!purdue!mentor.cc.purdue.edu!noose.ecn.purdue.edu!sparkyfs.erg.sri.com!csl.sri.com!csl!hercules!rar
- From: rar@csl.sri.com (Bob Riemenschneider)
- Newsgroups: comp.software-eng
- Subject: Re: Modeling inheritance hierarchy
- Message-ID: <RAR.92Sep3151332@birch.csl.sri.com>
- Date: 3 Sep 92 23:13:32 GMT
- References: <1992Aug31.040815.2300@kum.kaist.ac.kr>
- Sender: news@csl.sri.com (NEWS Administrator)
- Organization: Computer Science Lab, SRI International, Menlo Park, CA.
- Lines: 18
-
- In article <1992Aug31.040815.2300@kum.kaist.ac.kr> insang@salmosa.kaist.ac.kr (Chung InSang) writes:
-
- Is there anyone to know whether it is safe to assume that
- inheritance hierarchy of an object-oriented software is a complete lattice?
-
- This seems like such a peculiar question, I suspect that I must
- misunderstand it, but here goes: No, it is not safe to assume it's a
- complete lattice. In fact, it's fairly safe to assume that it's not a
- lattice -- I`ve never seen one that was -- though there are no
- guarantees. (In languages without multiple inhertance, the only
- lattices are chains.) As for "complete", since the structures are
- finite, this doesn't add anything.
-
- If not, which techniques can be used to deal with the problem?
-
- What exactly is the problem?
-
- -- rar
-