Re: language design implications for variant records in a pascal-like language

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Sat, 25 Dec 2010 23:21:46 +0100

          From comp.compilers
Related articles
language design implications for variant records in a pascal-like lang noitalmost@cox.net (noitalmost) (2010-12-22)
Re: language design implications for variant records in a pascal-like gneuner2@comcast.net (George Neuner) (2010-12-23)
Re: language design implications for variant records in a pascal-like danielzazula@gmail.com (Daniel Zazula) (2010-12-24)
Re: language design implications for variant records in a pascal-like bobduff@shell01.TheWorld.com (Robert A Duff) (2010-12-24)
Re: language design implications for variant records in a pascal-like mailbox@dmitry-kazakov.de (Dmitry A. Kazakov) (2010-12-25)
Re: language design implications for variant records in a pascal-like DrDiettrich1@aol.com (Hans-Peter Diettrich) (2010-12-25)
Re: language design implications for variant records in a pascal-like gene.ressler@gmail.com (Gene) (2010-12-27)
Re: language design implications for variant records in a pascal-like bobduff@shell01.TheWorld.com (Robert A Duff) (2010-12-27)
Re: language design implications for variant records in a pascal-like noitalmost@cox.net (noitalmost) (2010-12-27)
Re: language design implications for variant records in a pascal-like cr88192@hotmail.com (BGB) (2010-12-27)
Re: language design implications for variant records in a pascal-like bobduff@shell01.TheWorld.com (Robert A Duff) (2010-12-28)
[51 later articles]
| List of all articles for this month |
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.compilers
Date: Sat, 25 Dec 2010 23:21:46 +0100
Organization: cbb software GmbH
References: 10-12-040 10-12-045
Keywords: design, types
Posted-Date: 26 Dec 2010 23:06:11 EST

On Fri, 24 Dec 2010 12:50:20 -0500, Robert A Duff wrote:


> Boolean is fundamentally two-valued; it's
> not at all "object oriented".


This is untrue. Boolean lattice can be extended to tri-valued lattice,
four-valued lattice (Belnap logic), infinitely valued lattice (fuzzy logic)
and many other logics. Yes, some properties of the Boolean lattice can be
lost (e.g. the law of excluded middle, some idempotent operations could
lose this property etc). But any non-trivial extension of any set always
loses some properties of the original set. Booleans are object oriented as
anything else. The mathematical notion of lattice is one of the classes of
which the Boolean type is an instance, very OO.


--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.