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.
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01286469
Contributor : Pierre Clairambault <>
Submitted on : Thursday, March 10, 2016 - 6:23:15 PM
Last modification on : Thursday, October 4, 2018 - 1:15:42 AM
Document(s) archivé(s) le : Monday, June 13, 2016 - 8:52:48 AM

File

fossacs2015.pdf
Files produced by the author(s)

Identifiers

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. ⟨10.1007/978-3-662-46678-0_4⟩. ⟨hal-01286469⟩

Share

Metrics

Record views

306

Files downloads

103