Displaying similar documents to “Demonic semantics: using monotypes and residuals.”

An abstract monadic semantics for value recursion

Eugenio Moggi, Amr Sabry (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

This paper proposes an operational semantics for value recursion in the context of monadic metalanguages. Our technique for combining value recursion with computational effects works uniformly for all monads. The operational nature of our approach is related to the implementation of recursion in Scheme and its monadic version proposed by Friedman and Sabry, but it defines a different semantics and does not rely on assignments. When contrasted to the axiomatic approach proposed by Erkök...

Towards specifying with inclusions.

Jaume Agustí, Jordi Puigsegur, W. Marco Schorlemmer (1997)

Mathware and Soft Computing

Similarity:

In this article we present a functional specification language based on inclusions between set expressions. Instead of computing with data individuals we deal with their classification into sets. The specification of functions and relations by means of inclusions can be considered as a generalization of the conventional algebraic specification by means of equations. The main aim of this generalization is to facilitate the incremental refinement of specifications. Furthermore, inclusional...

Repetitions and permutations of columns in the semijoin algebra

Dirk Leinders, Jan Van Den Bussche (2009)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Codd defined the relational algebra [E.F. Codd, Communications of the ACM 13 (1970) 377–387; E.F. Codd, Relational completeness of data base sublanguages, in Data Base Systems, R. Rustin, Ed., Prentice-Hall (1972) 65–98] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed,...

Local Boolean manifolds from knowledge representation systems.

Gianpiero Cattaneo (1996)

Mathware and Soft Computing

Similarity:

We introduce a structure to represent observations on entities in order to obtain knowledge about some of their characteristic properties or attributes. This structure is based on the Pawlak's definition of information systems (also knowledge representation systems) and lead us to obtain algebraic structures of lattice depending from the choice of an observational context. The semantical algebraic structure so obtained is of local Boolean manifold whose global structure is an orthoposet...

KAT and PHL in Coq

David Pereira, Nelma Moreira (2008)

Computer Science and Information Systems

Similarity:

A coalgebraic semantics of subtyping

Erik Poll (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Coalgebras have been proposed as formal basis for the semantics of objects in the sense of object-oriented programming. This paper shows that this semantics provides a smooth interpretation for subtyping, a central notion in object-oriented programming. We show that different characterisations of behavioural subtyping found in the literature can conveniently be expressed in coalgebraic terms. We also investigate the subtle difference between behavioural subtyping and refinement. ...