Abstract data type declarations appear in typed programming languages like Ada, Alphard, CLU and ML. This form of declaration binds a list of identifiers to a type with associated operations, a composite “value ” we call a data algebra. We use a second-order typed lambda calculus SOL to show how data algebras may be given types, passed as parameters, and returned as results of function calls. In the process, we discuss the semantics of abstract data type declarations and review a connection between typed programming languages and constructive logic
AbstractImplementations of abstract data types are defined via enrichments of a target type. We prop...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
Software developers often structure programs in such a way that different pieces of code constitute ...
We demonstrate that a uniformity of approach to both the definition and implementation of programmin...
This paper considers the general problem of specifying the meaning of programming languages which i...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Data Types Konstantin Läufer Martin Odersky Loyola University of Chicago Universität Karlsruhe lau...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.This thesis is concerned with...
A new data type declaration mechanism of defining codatatypes is introduced to a functional programm...
Many computer scientists advocate using axiomatic methods (such as algebraic specification) to spec...
AbstractThis paper is concerned with the foundations of an extension of pure type systems by abstrac...
This paper presents an untyped lambda calculus, extended with object primitives that reflect the cap...
This dissertation investigates the use of the algebraic style of abstract data type specifications ...
Introduction: In current programming languages, data types and the associated type machinery are use...
AbstractImplementations of abstract data types are defined via enrichments of a target type. We prop...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
Software developers often structure programs in such a way that different pieces of code constitute ...
We demonstrate that a uniformity of approach to both the definition and implementation of programmin...
This paper considers the general problem of specifying the meaning of programming languages which i...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Data Types Konstantin Läufer Martin Odersky Loyola University of Chicago Universität Karlsruhe lau...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.This thesis is concerned with...
A new data type declaration mechanism of defining codatatypes is introduced to a functional programm...
Many computer scientists advocate using axiomatic methods (such as algebraic specification) to spec...
AbstractThis paper is concerned with the foundations of an extension of pure type systems by abstrac...
This paper presents an untyped lambda calculus, extended with object primitives that reflect the cap...
This dissertation investigates the use of the algebraic style of abstract data type specifications ...
Introduction: In current programming languages, data types and the associated type machinery are use...
AbstractImplementations of abstract data types are defined via enrichments of a target type. We prop...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
Software developers often structure programs in such a way that different pieces of code constitute ...