scientific article; zbMATH DE number 3880077

MaRDI QIDQ3345748zbMATH OpenFDO

Authors Rod Burstall, Butler Lampson

Publication date 1984

zbMATH Keywords

abstract data typesgeneric typesimplementationsinference rulesinterfacesmodulesoperational semanticsrecursive typestyped lambda calculusunions

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Data structures (68P05)

Recommendations

• Pebble, a kernel language for modules and abstract data types
• On the implementation of abstract data types by programming language constructs
• scientific article; zbMATH DE number 3898212
• A modular module system
• An abstract, reusable, and extensible programming language design architecture

Cited in

(18)

• A view of programming languages as symbiosis of meaning and computations
• Pebble, a kernel language for modules and abstract data types
• A calculus for reasoning about software composition
• Types for modules
• Types in programming languages, between modelling, abstraction, and correctness (extended abstract)
• scientific article; zbMATH DE number 3888904 (Why is no real title available?)
• Encapsulation constructs in systems programming languages
• The design of Apple—A language for modular programs
• Manifest Fields and Module Mechanisms in Intensional Type Theory
• A simple and general theoretical account for abstract types
• scientific article; zbMATH DE number 3926271 (Why is no real title available?)
• G: A functional language with generic abstract data types
• Why adjunctions matter -- a functional programmer perspective
• Categorical ML -- category-theoretic modular programming
• Rod Burstall: in memoriam (1934--2025)
• Retractions of dI-domains as a model for Type:Type
• On the classification of binding mechanisms
• A note on Russell's paradox in locally Cartesian closed categories

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3345748)