FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES
MetadataShow full item record
We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yields a close fit between models and programming language. Two of our semantics of type expressions are faithful, in the sense that programs that behave identically in all contexts have exactly the same types.