Curry-style type Isomorphisms and Game Semantics - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

Curry-style type Isomorphisms and Game Semantics

Joachim de Lataillade
  • Fonction : Auteur
  • PersonId : 840194

Résumé

Curry-style system F, ie. system F with no explicit types in terms, can be seen as a core presentation of polymorphism from the point of view of programming languages. This paper gives a characterisation of type isomorphisms for this language, by using a game model whose intuitions come both from the syntax and from the game semantics universe. The model is composed of: an untyped part to interpret terms, a notion of game to interpret types, and a typed part to express the fact that an untyped strategy plays on a game. By analysing isomorphisms in the model, we prove that the equational system corresponding to type isomorphisms for Curry-style system F is the extension of the equational system for Church-style isomorphisms with a new, non-trivial equation: forall X.A = A[forall Y.Y/X] if X appears only positively in A.
Fichier principal
Vignette du fichier
wit2006.pdf (276.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00150156 , version 1 (29-05-2007)

Identifiants

Citer

Joachim de Lataillade. Curry-style type Isomorphisms and Game Semantics. 2007. ⟨hal-00150156⟩
63 Consultations
107 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More