Add to ORKGThis paper investigates a method to represent database objects as typed expressions in programming languages. A simple typed language supporting non-flat records, higher-order relations, and natural join expressions is defined. A denotational semantics of this language is then presented. Expressions are interpreted into a domain containing Smyth's powerdomain. In order to give semantics to types, a new model of types, a filter model is proposed. Types are then interpreted as filters in a domain. The type inference system of the language is shown to be sound in this model
To date, current investigations on Semi-Structured Data (SSD) have focused on query languages that o...
The object-oriented data model TM is a language that is based on the formal theory of FM, a typed la...
A database programming language can model application domains most naturally if it supports several ...
This paper investigates a method to represent database objects as typed expressions in programming l...
AbstractA number of data models for complex database objects have been proposed. Unfortunately, thes...
This paper proposes a framework of denotational semantics of database type systems and constructs a ...
This work presents first steps towards a denotational semantics for relational databases. It is argu...
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 ...
In this report we propose a new approach to types and static type checking in object-oriented databa...
Much of relational algebra and the underlying principles of relational data-base design have a simpl...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
The notion of type has played a double role in database systems in that it has been used both to des...
We consider the problem of representing heterogeneous collections of objects in a typed polymorphic ...
To date, current investigations on Semi-Structured Data (SSD) have focused on query languages that o...
The object-oriented data model TM is a language that is based on the formal theory of FM, a typed la...
A database programming language can model application domains most naturally if it supports several ...
This paper investigates a method to represent database objects as typed expressions in programming l...
AbstractA number of data models for complex database objects have been proposed. Unfortunately, thes...
This paper proposes a framework of denotational semantics of database type systems and constructs a ...
This work presents first steps towards a denotational semantics for relational databases. It is argu...
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 ...
In this report we propose a new approach to types and static type checking in object-oriented databa...
Much of relational algebra and the underlying principles of relational data-base design have a simpl...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
The notion of type has played a double role in database systems in that it has been used both to des...
We consider the problem of representing heterogeneous collections of objects in a typed polymorphic ...
To date, current investigations on Semi-Structured Data (SSD) have focused on query languages that o...
The object-oriented data model TM is a language that is based on the formal theory of FM, a typed la...
A database programming language can model application domains most naturally if it supports several ...