scispace - formally typeset
Search or ask a question

Showing papers presented at "International Conference on Mathematical Foundations of Programming Semantics in 1986"


Proceedings Article
01 Oct 1986

8 citations


Book ChapterDOI
01 Oct 1986
TL;DR: A method of denotational formalization of data bases, of data base management systems, and of related structures is proposed, aiming to improve their understanding, specification and rigorous investigation.
Abstract: A method of denotational formalization of data bases, of data base management systems, and of related structures is proposed, aiming to improve their understanding, specification and rigorous investigation. The method provides a uniform treatment of different information layers: from instantaneous data bases (the first layer), via schemata and integrity rules, to classes of data base models. It unifies in one mathematical notion the apparently different notions of the semantics of stored data, semantics of data base processes, conceptual semantics of data bases, integrity semantics of data bases and denotational semantics of languages. The unification is based on hierarchies of domains of continuous mappings between different representations of information (from "less semantic" representations into "more semantic" ones).

7 citations


Book ChapterDOI
01 Oct 1986

7 citations


Book ChapterDOI
01 Oct 1986
TL;DR: This paper presents a formulation for the standard semantics of block structure and ALGOL 60 style call-by-name using continuations and streams, which allow the formulation of program “pipes” exactly like compound functions.
Abstract: This paper presents a formulation for the standard semantics of block structure and ALGOL 60 style call-by-name. The main features of this formulation are the use of continuations and streams. Continuations are used in such a way that the semantics can be defined without requiring the idea of an explicit store. Thus the concepts of address or L- and R- values are not used, and simple continuations suffice for describing assignments, iterative control statements, compounds, blocks, and functions using call by value. (Side effects are still allowed via assignments to variables global to functions.) Call-by-name is handled by introducing the idea of multiple continuations. Input-output is treated by using streams. In conjunction with continuations, these allow the formulation of program “pipes” exactly like compound functions.

5 citations



Book ChapterDOI
01 Oct 1986
TL;DR: It turns out that several types of ‘completions’ of concrete categories can be characterized as injective hulls.
Abstract: The paper consists of two parts. In the first part the concepts of injective objects, essential extensions, and injective hulls are illustrated by examples of known characterizations of these concepts in various familiar settings. In the second part the above notions are considered in quasicategories whose objects are concrete categories. It turns out that several types of ‘completions’ of concrete categories can be characterized as injective hulls.

1 citations