Pebble, a kernel language for modules and abstract data types
From MaRDI portal
Publication:1104071
DOI10.1016/0890-5401(88)90011-9zbMATH Open0646.68018OpenAlexW2039123207MaRDI QIDQ1104071FDOQ1104071
Authors: Butler Lampson, Rod 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
Recommendations
modulesinterfacesrecursive typesabstract data typesinference rulesoperational semanticsgeneric typestyped lambda calculusunionsimplementationskernel languagePebble
Cites Work
- A theory of type polymorphism in programming
- Edinburgh LCF. A mechanized logic of computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The next 700 programming languages
- An ideal model for recursive polymorphic types
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Manifest Fields and Module Mechanisms in Intensional Type Theory
- Generalization from partial parametrization in higher-order type theory
- An ``executable impredicative semantics for the Ada configuration
- Types for modules
- Towards a computation system based on set theory
- The foundational legacy of ASL
- Type checking with universes
- Meta-circular interpreter for a strongly typed language
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
- Title not available (Why is that?)
- A higher-order calculus and theory abstraction
Uses Software
This page was built for publication: Pebble, a kernel language for modules and abstract data types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104071)