Pebble, a kernel language for modules and abstract data types
From MaRDI portal
(Redirected from Publication:1104071)
Recommendations
Cites work
- A theory of type polymorphism in programming
- An ideal model for recursive polymorphic types
- Edinburgh LCF. A mechanized logic of computation
- scientific article; zbMATH DE number 3864476 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 3521950 (Why is no real title available?)
- scientific article; zbMATH DE number 3584904 (Why is no real title available?)
- scientific article; zbMATH DE number 3635529 (Why is no real title available?)
- The next 700 programming languages
Cited in
(12)- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- Generalization from partial parametrization in higher-order type theory
- Type checking with universes
- Towards a computation system based on set theory
- An ``executable impredicative semantics for the Ada configuration
- Types for modules
- A higher-order calculus and theory abstraction
- scientific article; zbMATH DE number 3880077 (Why is no real title available?)
- Manifest Fields and Module Mechanisms in Intensional Type Theory
- The foundational legacy of ASL
- Rod Burstall: in memoriam (1934--2025)
- Meta-circular interpreter for a strongly typed language
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)