We offer here an overview of several initial attempts of formalisation of relational database theory in a constructive, type-theoretic, framework. Each successive formalisation is of more generality, and correspondingly more complex, than the previous one. All our work is carried out in the proof editor Alfa for Martin-Löf's monomorphic type theory. Our goal is to obtain a formalisation that provides us with computational content, instead of just being a completely abstract theory.12 page(s
Abstract. We present a generalisation of the type-theoretic interpre-tation of constructive set theo...
Bulk types such as sets, bags, and lists are monads, and therefore support a notation for database q...
Abstract. 3 This article summarizes mathematical formalisms used to describe ob-ject and object-orie...
We offer here an overview of several initial attempts of formalisation of relational database theory...
Abstract. We present a soundness theorem for a dependent type theory with context con-stants with re...
Abstract. It is well known that finite model theory and database theory are two disciplines intimat...
AbstractA number of data models for complex database objects have been proposed. Unfortunately, thes...
In this thesis we explore the question of how to represent programming data structures in a constru...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
AbstractWe give a polymorphic account of the relational algebra. We introduce a formalism of “type f...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
We present a generalisation of the type-theoretic interpretation of constructive set theory into Mar...
This paper proposes a framework of denotational semantics of database type systems and constructs a ...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
Abstract. We present a generalisation of the type-theoretic interpre-tation of constructive set theo...
Bulk types such as sets, bags, and lists are monads, and therefore support a notation for database q...
Abstract. 3 This article summarizes mathematical formalisms used to describe ob-ject and object-orie...
We offer here an overview of several initial attempts of formalisation of relational database theory...
Abstract. We present a soundness theorem for a dependent type theory with context con-stants with re...
Abstract. It is well known that finite model theory and database theory are two disciplines intimat...
AbstractA number of data models for complex database objects have been proposed. Unfortunately, thes...
In this thesis we explore the question of how to represent programming data structures in a constru...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
AbstractWe give a polymorphic account of the relational algebra. We introduce a formalism of “type f...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
We present a generalisation of the type-theoretic interpretation of constructive set theory into Mar...
This paper proposes a framework of denotational semantics of database type systems and constructs a ...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
Abstract. We present a generalisation of the type-theoretic interpre-tation of constructive set theo...
Bulk types such as sets, bags, and lists are monads, and therefore support a notation for database q...
Abstract. 3 This article summarizes mathematical formalisms used to describe ob-ject and object-orie...