Results 1 
9 of
9
Operations on records
 Mathematical Structures in Computer Science
, 1991
"... We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A secondorder type system over these operations supports both subtyping and polymorphism. We provide typechecking algorithms and limite ..."
Abstract

Cited by 143 (13 self)
 Add to MetaCart
We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A secondorder type system over these operations supports both subtyping and polymorphism. We provide typechecking algorithms and limited semantic models. Our approach unifies and extends previous notions of records, bounded quantification, record extension, and parametrization by rowvariables. The general aim is to provide foundations for concepts found in objectoriented languages, within a framework based on typed lambdacalculus.
A theory of primitive objects: secondorder systems
 Proc. ESOP’94  European Symposium on Programming
"... We describe a secondorder calculus of objects. The calculus supports object subsumption, method override, and the type Self. It is constructed as an extension of System F with subtyping, recursion, and firstorder object types. 1. ..."
Abstract

Cited by 57 (8 self)
 Add to MetaCart
We describe a secondorder calculus of objects. The calculus supports object subsumption, method override, and the type Self. It is constructed as an extension of System F with subtyping, recursion, and firstorder object types. 1.
Behavioral Equivalence in the Polymorphic PiCalculus
 JOURNAL OF THE ACM
, 1997
"... We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manip ..."
Abstract

Cited by 55 (6 self)
 Add to MetaCart
We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic picalculus and ML.
On subtyping and matching
 In Proceedings ECOOP '95
, 1995
"... Abstract. A relation between recursive object types, called matching, has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regar ..."
Abstract

Cited by 45 (3 self)
 Add to MetaCart
Abstract. A relation between recursive object types, called matching, has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of Fbounded subtyping (as was originally intended). We show that a new interpretation of matching as higherorder subtyping has better properties. Matching turns out to be a thirdorder construction, possibly the only one to have been proposed for general use in programming.
SecondOrder Signature: A Tool for Specifying Data Models
 Query Processing, and Optimization. Proc. ACM SIGMOD Conf
, 1993
"... We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rulebased optimization that can be used with widely varying data models and query languages as well as representation and query processing systems. T ..."
Abstract

Cited by 29 (19 self)
 Add to MetaCart
We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rulebased optimization that can be used with widely varying data models and query languages as well as representation and query processing systems. The key idea is to use secondorder signature (and algebra), a system of two coupled manysorted signatures, where the toplevel signature offers kinds and type constructors and the bottomlevel signature provides polymorphic operations over the types defined as terms of the top level. Hence the top level can be used to define a data or representation model and the bottom level to describe a query algebra or a query processing algebra. We show the applicability of this framework by examples drawn from relational modeling and query processing.
A theory of class
 In Proc. 3rd Int. Conf. ObjectOriented Info. Sys
, 1996
"... ABSTRACT: We present a mathematical theory of class. The theory is general, in that it encompasses many different approaches to type abstraction, such as type constructors, generic parameters, classes, inheritance and polymorphism. The theory is elegant, in that it is based on a simple generalisatio ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ABSTRACT: We present a mathematical theory of class. The theory is general, in that it encompasses many different approaches to type abstraction, such as type constructors, generic parameters, classes, inheritance and polymorphism. The theory is elegant, in that it is based on a simple generalisation of Fbounds. The theory has timely implications for emerging OMG standards and future language designs. KEYWORDS: objectoriented, type theory, Fbounds, class, classification, generic parameters, polymorphism, inheritance
On the Equational Theory of NonNormalising Pure Type Systems
, 2001
"... this paper we are chieAEy concerned with the specications U \Gamma , U and . The denitions are taken from e.g. [1] ..."
Abstract
 Add to MetaCart
this paper we are chieAEy concerned with the specications U \Gamma , U and . The denitions are taken from e.g. [1]
An Optimized Complete SemiAlgorithm for System . . .
, 1999
"... In this paper we give a new deterministic presentation of system F with reduction. This presentation allow us to write a complete semialgorithm for this system that may be useful in a real programming language. keywords: lambdacalculus, typeinference, typechecking 1 Introduction Motivation M ..."
Abstract
 Add to MetaCart
In this paper we give a new deterministic presentation of system F with reduction. This presentation allow us to write a complete semialgorithm for this system that may be useful in a real programming language. keywords: lambdacalculus, typeinference, typechecking 1 Introduction Motivation Most of the statically typed programming language (SML, OCaml, Haskell, ...) are based on Milner's restriction [1] of Girard and Reynolds System F [4, 13]. To improve the language, some complex extensions of the typesystem are added to handle the needed features (modules with abstract types, object, some kind of polymorphic recursion). These extensions are quite complex both at the theoretical and the programming level. However, they leads to a decidable typeinference algorithm. Most, if not all, of these extensions could be handled inside system F. For instance, existential types are denable in system F and can be used to construct tuples with abstract types which correspond to the notio...
A normalization proof for MartinLöf's type theory
, 1996
"... The theory we will be concerned with in this paper is MartinLöf's polymorphic type theory with intensional equality and the universe of small sets. We will give a different proof of normalization for this theory. ..."
Abstract
 Add to MetaCart
The theory we will be concerned with in this paper is MartinLöf's polymorphic type theory with intensional equality and the universe of small sets. We will give a different proof of normalization for this theory.