Building continuous webbed models for System F

Stefano Berardi (1) , Chantal Berline (2)

1 Dipartimento di Informatica [Torino]
2 PPS - Preuves, Programmes et Systèmes

We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a noncategorical setting. The family generalizes the construction of the model of Barbanera and Berardi, hence it contains models which are complete for F. It also contains simpler models, the simplest of them, E², being a second-order variant of the Engeler-Plotkin model E. All the models here belong to the continuous semantics, all have the maximum number of polymorphic maps. The class contains models which can be viewed as two intertwined compatible webbed models of untyped lambda-calculus, but is much larger than this. Finally many of its models might be read as two intertwined strict intersection type systems.

Mots clés: polymorphism; lambda-calculus; continuous semantics; webbed models; polymax models

Domaines: Logique [math.LO]

Stefano Berardi, Chantal Berline. Building continuous webbed models for System F. Theoretical Computer Science, 2004, 315, pp.3-34. ⟨hal-00003750⟩