FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES

DOI10.1142/S0129054191000029MaRDI QIDQ3988831zbMATH OpenOpenAlexFDO

Authors Martín Abadi, Benjamin C. Pierce, 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

full abstractionidealsmetric modelspolymorphismrecursive types

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4180813
• Semantic types: a fresh look at the ideal model for types
• An ideal model for recursive polymorphic types
• Adequacy for a lazy functional language with recursive and polymorphic types
• Recursive types for Fun

Cited in

(7)

• Adequacy for a lazy functional language with recursive and polymorphic types
• scientific article; zbMATH DE number 4180813 (Why is no real title available?)
• Semantic types: a fresh look at the ideal model for types
• An ideal model for recursive polymorphic types
• scientific article; zbMATH DE number 4126291 (Why is no real title available?)
• 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

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