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

Abadi, Martin

Pierce, Benjamin

Plotkin, Gordon

Edinburgh Research Archive

FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES

A proposal for Standard ML.

An ideal model for recursive polymorphic types.

Computing with recursive types.

Fully Abstract Models of Programming Languages.

Fully abstract models of typed -calculi.

Fully abstract models of typed λ-calculi.

LCF considered as a programming language.

Semantical paradigms: notes for an invited lecture.

Sur les op´ erations dans les ensembles abstraits et leurs applications aux ´ equations int´ egrales.

Sur les ope´rations dans les ensembles abstraits et leurs applications aux e´quations inte´grales.

The Lambda Calculus. North Holland, Revised edition,

https://era.ed.ac.uk/bitstream/1842/181/1/faithful_ideal-models.pdf

FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Archive