|
[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Data binding as type definition
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_
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|
|||||||||

Cart








