FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES

DOI10.1142/S0129054191000029zbMath0741.68026OpenAlexW2070429853MaRDI QIDQ3988831

Benjamin C. Pierce, Martín Abadi, Gordon D. Plotkin

Publication date: 28 June 1992

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054191000029

zbMATH Keywords

polymorphismidealsfull abstractionrecursive typesmetric models

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (2)

Labelled reductions, runtime errors, and operational subsumption ⋮ Syntactic soundness proof of a type-and-capability system with hidden state

This page was built for publication: FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES