Barr, M., Wells, C. The formal description of data types using sketches. In M. Main, A. Melton, M. Mislove, D. Schmidt (eds.), Mathematical Foundations of Programming Language Semantics, Springer-Verlag, Lecture Notes in Computer Science 298, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....rather than storable and their semantics can be explained in the abstract data type (ADT) framework (see, eg, 23] In fact, hInti, hDatei etc are names of (quasi)equational specifications whose initial semantics gives the intended extension. One can use sketches for specifying ADT too ([41]) then a value domain node is an entry to some complex sketch. As for hfa,c,qgi domain, its extension has to be stored but together with the database schema rather than with the database extension. 2.1.4 Some words about optional attributes would be useful. A proper approach is to treat them as ....

C. Wells and M. Barr. The formal description of data types using sketches. In Mathematical foundations of Programming language semantics, volume 298 of Springer LNCS, 1988.

....are closed under finite products (as defined in Example 4. 1 below) Although Lawvere s original development was unsorted, it easily extends to the many sorted case, and in many other ways, including the so called sketches studied by Ehresmann, Gray, Barr, Wells, and others; for example, see [3]. Of course, all the theories of a given kind form a category. 1.1 Isomorphism One very simple, but still significant, fruit of category theory is a general definition of isomorphism, suitable for any species of structure at all: a morphism f : A B is an isomorphism in a category C iff there is ....

Michael Barr and Charles Wells. The formal description of data types using sketches. In Michael Main, A. Melton, Michael Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Language Semantics. Springer, 1988. Lecture Notes in Computer Science, Volume 298.

....In our situation, the translation composition C ffi P is a model morphism of the combinator syntactic category into itself and thus, by uniqueness, can only be the identity translation. Further details and explanations of sketches, their models, and model morphisms are available to the reader in [11, 10]. The complete development of this particular method is presented in [2] 4 Conclusions and Future Work The Charity project at Calgary has verified that significant algorithms can be coded, compiled, and run with its categorical programming language compiler built atop the term logic. Such ....

C. Wells and M. Barr. The formal description of data types using sketches. In Mathematical Foundations of Programming Language Semantics, volume 298 of Lecture Notes in Computer Science, Tulane University, April 1987. Springer-Verlag.

....property of AGO specifications providing essentially all their advantages consists in a special discipline of labeling: it is rigorously formalized, consistent and mathematically justified. We call AGO specifications sketches following the terminology tradition of categorical logic (see, eg, [20, 2]) which is a graph based higher order logic, as opposed to string based ones, and can be seen as a graph based counterpart of the ordinary many sorted relational logic. The essence of the sketch approach to data modeling consists in considering all object classes homogeneous while all type ....

C. Wells and M. Barr. The formal description of data types using sketches. In Mathematical foundations of Programming language semantics, volume 298 of Springer LNCS, 1988.

No context found.

Barr, M., Wells, C. The formal description of data types using sketches. In M. Main, A. Melton, M. Mislove, D. Schmidt (eds.), Mathematical Foundations of Programming Language Semantics, Springer-Verlag, Lecture Notes in Computer Science 298, 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC