Results 1 
5 of
5
Sketches: Outline with References
 Dept. of Computer Science, Katholieke Universiteit Leuven
, 1994
"... This document is an outline of the theory of sketches with pointers to the literature. An extensive bibliography is given. Some coverage is given to related areas such as algebraic theories, categorial model theory and categorial logic as well. An appendix beginning on page 11 provides definitions o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This document is an outline of the theory of sketches with pointers to the literature. An extensive bibliography is given. Some coverage is given to related areas such as algebraic theories, categorial model theory and categorial logic as well. An appendix beginning on page 11 provides definitions of some of the less standard terms used in the paper, but the reader is expected to be familiar with the basic ideas of category theory. A rough machine generated index begins on page 21. I would have liked to explain the main ideas of all the papers referred to herein, but I am not familiar enough with some of them to do that. It seemed more useful to be inclusive, even if many papers were mentioned without comment. One consequence of this is that the discussions in this document often go into more detail about the papers published in North America than about those published elsewhere. The DVI file for this article is available by anonymous FTP from ftp.cwru.edu in the directory
A parameterization process as a categorical construction
, 908
"... Abstract. The parameterization process used in the symbolic computation systems Kenzo and EAT is studied here as a general construction in a categorical framework. This parameterization process starts from a given specification and builds a parameterized specification by transforming some operations ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. The parameterization process used in the symbolic computation systems Kenzo and EAT is studied here as a general construction in a categorical framework. This parameterization process starts from a given specification and builds a parameterized specification by transforming some operations into parameterized operations, which depend on one additional variable called the parameter. Given a model of the parameterized specification, each interpretation of the parameter, called an argument, provides a model of the given specification. Moreover, under some relevant terminality assumption, this correspondence between the arguments and the models of the given specification is a bijection. It is proved in this paper that the parameterization process is provided by a free functor and the subsequent parameter passing process by a natural transformation. Various categorical notions are used, mainly adjoint functors, pushouts and lax colimits. 1
Diagrammatic Inference
, 710
"... Abstract. Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which is seen as a Yoneda functor on a bicategory of fractions. A diagrammatic logic is defined from a morphism of limi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which is seen as a Yoneda functor on a bicategory of fractions. A diagrammatic logic is defined from a morphism of limit sketches (called a propagator) which gives rise to an adjunction, which in turn determines a bicategory of fractions. The propagator, the adjunction and the bicategory provide respectively the syntax, the models and the inference process for the logic. Then diagrammatic logics and their morphisms are applied to the semantics of side effects in computer languages.
/ Towards Soft Typing in Computer Algebra
, 1998
"... This paper is a revised version of the notes for the tutorial of D. Duval at ISSAC’98. We are indebted to the participants of the working group on sketches and computer algebra for their questions and suggestions, and to C.N.R.S. for its support. This document was processed with LATEX and XYpic. ..."
Abstract
 Add to MetaCart
This paper is a revised version of the notes for the tutorial of D. Duval at ISSAC’98. We are indebted to the participants of the working group on sketches and computer algebra for their questions and suggestions, and to C.N.R.S. for its support. This document was processed with LATEX and XYpic.
Scetches and Specifications User'S Gude  First . . .
, 2000
"... SKETCHES AND SPECIFICATIONS is a common denomination for several papers which deal with applications of Ehresmann’s sketch theory to computer science. These papers can be considered as the first steps towards a unified theory for software engineering. However, their aim is not to advocate a unificat ..."
Abstract
 Add to MetaCart
SKETCHES AND SPECIFICATIONS is a common denomination for several papers which deal with applications of Ehresmann’s sketch theory to computer science. These papers can be considered as the first steps towards a unified theory for software engineering. However, their aim is not to advocate a unification of computer languages; they are designed to build a frame for the study of notions which arise from several areas in computer science. These papers are arranged in two complementary families: REFERENCE MANUAL and USER’S GUIDE. The reference manual provides general definitions and results, with comprehensive proofs. On the other hand, the user’s guide places emphasis on motivations and gives a detailed description of several examples. These two families, though complementary, can be read independently. No prerequisite is assumed; however, it can prove helpful to be familiar either with specification techniques in computer science or with category theory in mathematics. These papers are under development, they are, or will be, available at: