Pebble, a kernel language for modules and abstract data types

DOI10.1016/0890-5401(88)90011-9zbMath0646.68018OpenAlexW2039123207MaRDI QIDQ1104071

B. W. Lampson, Rod M. Burstall

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90011-9

zbMATH Keywords

modulesoperational semanticsinterfacesunionstyped lambda calculusinference rulesrecursive typesabstract data typesgeneric typesimplementationskernel languagePebble

Mathematics Subject Classification ID

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

Related Items (10)

An ``executable impredicative semantics for the Ada configuration ⋮ Types for modules ⋮ A higher-order calculus and theory abstraction ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Generalization from partial parametrization in higher-order type theory ⋮ Meta-circular interpreter for a strongly typed language ⋮ Type checking with universes ⋮ Manifest Fields and Module Mechanisms in Intensional Type Theory ⋮ Towards a computation system based on set theory ⋮ The Foundational Legacy of ASL

Uses Software

• ML

Cites Work

• A theory of type polymorphism in programming
• Edinburgh LCF. A mechanized logic of computation
• An ideal model for recursive polymorphic types
• The next 700 programming languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pebble, a kernel language for modules and abstract data types