Game Semantics and Normalization by Evaluation

Abstract : We show that Hyland and Ong's game semantics for PCF can be presented using normalization by evaluation (nbe). We use the bijective correspondence between innocent well-bracketed strategies and PCF Böhm trees, and show how operations on PCF Böhm trees, such as composition, can be computed lazily and simply by nbe. The usual equations characteristic of games follow from the nbe construction without reference to low-level game-theoretic machinery. As an illustration, we give a Haskell program computing the application of innocent strategies.
Type de document :
Communication dans un congrès
18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Apr 2015, Londres, United Kingdom. Proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), 9034, 2015, Foundations of Software Science and Computation Structures. 〈10.1007/978-3-662-46678-0_4〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01286469
Contributeur : Pierre Clairambault <>
Soumis le : jeudi 10 mars 2016 - 18:23:15
Dernière modification le : jeudi 4 octobre 2018 - 01:15:42
Document(s) archivé(s) le : lundi 13 juin 2016 - 08:52:48

Fichier

fossacs2015.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Pierre Clairambault, Peter Dybjer. Game Semantics and Normalization by Evaluation. 18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Apr 2015, Londres, United Kingdom. Proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), 9034, 2015, Foundations of Software Science and Computation Structures. 〈10.1007/978-3-662-46678-0_4〉. 〈hal-01286469〉

Partager

Métriques

Consultations de la notice

207

Téléchargements de fichiers

75