Filter models: non-idempotent intersection types, orthogonality and polymorphism - Archive ouverte HAL
Rapport Année : 2011

Filter models: non-idempotent intersection types, orthogonality and polymorphism

Résumé

This paper revisits models of typed lambda-calculus based on filters of intersection types: By using non-idempotent intersections, we simplify a methodology that produces modular proofs of strong normalisation based on filter models. Non-idempotent intersections provide a decreasing measure proving a key termination property, simpler than the reducibility techniques used with idempotent intersections. Such filter models are shown to be captured by orthogonality techniques: we formalise an abstract notion of orthogonality model inspired by classical realisability, and express a filter model as one of its instances, along with two term-models (one of which captures a now common technique for strong normalisation). Applying the above range of model constructions to Curry-style System F describes at different levels of detail how the infinite polymorphism of System F can systematically be reduced to the finite polymorphism of intersection types.
Fichier principal
Vignette du fichier
CSL11.pdf (288.92 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00600070 , version 1 (13-06-2011)
hal-00600070 , version 2 (20-06-2011)
hal-00600070 , version 3 (20-06-2011)

Identifiants

  • HAL Id : hal-00600070 , version 1

Citer

Stéphane Lengrand, Alexis Bernadet. Filter models: non-idempotent intersection types, orthogonality and polymorphism. 2011. ⟨hal-00600070v1⟩
229 Consultations
110 Téléchargements

Partager

More