Re: Implementation of boolean types.

From: -CELKO- <jcelko212_at_earthlink.net>
Date: 14 Jul 2005 17:46:56 -0700
Message-ID: <1121388416.201523.9960@f14g2000cwb.googlegroups.com>

>> Where do you think the definition of natual join comes from? <<

Getting serious for a minute, Tom Johnston had a paper and a conversation with Dr. Codd about problems with the Natural Join because we cannot be sure which of the two or more columns are or are not in the resulting relation.

>> A language not having a clean treatment of the boolean type in version 1 is a sign of bad design. <<

Procedural languages, not declarative ones. Dijkstra "only" worked with non-deterministic procedural languages. I think that we grew up with the Dijkstra/ Manna/ Gries model of programming that we had a bitch of a time with RM. I think I can say that with authority since my first Master's Thesis was on an algebra of Structured Programming :) Received on Thu Jul 14 2005 - 19:46:56 CDT