• To: simonstl@s... (Simon St.Laurent)
• Subject: Re: Data binding as type definition
• From: John Cowan <jcowan@r...>
• Date: Tue, 11 Jun 2002 12:37:37 -0400 (EDT)
• Cc: xml-dev@l...
• In-reply-to: <4.2.0.58.20020611122555.01274f10@p...> from "Simon St.Laurent" at Jun 11, 2002 12:27:04 PM

Simon St.Laurent scripsit:

> I guess I think of those constraints as bonus things you can do once you 
> have identified a type, not as something intrinsic to a particular 
> type.  Sort of like constraints applied through get/set accessors in Java.

Note my definition of type: a named class of values.  (The name can be
a complex name, of course, like "non-negative integer" or "integer between
-200 and 55678".)

Mathematical note: the reason I insist on a type being named is to rein
in higher-order infinities.  There are \aleph_0 values, and therefore there
are 2^\aleph_0 = \aleph_1 classes of values, but only \aleph_0 names.
Necessarily therefore a great many classes, corresponding to transcendental
real numbers, go unnamed.

-- 
John Cowan <jcowan@r...>     http://www.reutershealth.com
I amar prestar aen, han mathon ne nen,    http://www.ccil.org/~cowan
han mathon ne chae, a han noston ne 'wilith.  --Galadriel, _LOTR:FOTR_

• Follow-Ups:
  • Re: Data binding as type definition
    • From: "Simon St.Laurent" <simonstl@s...>

• References:
  • Re: Data binding as type definition
    • From: "Simon St.Laurent" <simonstl@s...>

• Prev by Date: Re: W3C Schema: Resistance is Futile, says Don Box
• Next by Date: Re: W3C Schema: Resistance is Futile, says Don Box
• Previous by thread: Re: Data binding as type definition
• Next by thread: Re: Data binding as type definition
• Index(es):
  • Date
  • Thread