The possibility of finding a static type system for object-oriented programming languages was initiated by Cardelli [Car88, CW85] who showed that it is possible to express the polymorphic nature of functions such a

Breazu-Tannen, Val

Buneman, Peter

Ohori, Atsushi

English

Edinburgh Research Explorer

a powerful and simple database language.

A record calculus based on symmetric concatenation.

A semantics of multiple inheritance.

A theory of type polymorphism in programming.

A type system that reconcile classes and extents.

An approach to persistent programming.

Database programming in Machiavelli – a polymorphic language with static type inference.

Dynamic typing in a statically-typed language. In

Extending polymorphism to records and variants.

Logical and Computational Aspects of Programming with Sets/Bags/Lists. To appear in

ML with extended pattern matching and subtypes.

O2, an object-oriented data model.

On understanding types, data abstraction, and polymorphism.

Semantics of types for database objects.

Some high level language constructs for data of type relation.

Static type inference for parametric classes. In

Structural Recursion as a Query Language. Unpublished Manuscript,

The C++ programming language.

The objectoriented database system manifesto.

Type inference in a database programming language. In

Type inference with subtypes.

Typechecking records and variants in a natural extension of ML.

Types and persistence in database programming languages.

Data Structures and Data Types in Object-Oriented Databases

http://homepages.inf.ed.ac.uk/opb/papers/IEEEDE1991.pdf

Data Structures and Data Types in Object-Oriented Databases

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer