Game semantics and normalization by evaluation
Paper i proceeding, 2015

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.

Författare

P. Clairambault

Ecole Normale Superieure de Lyon

Peter Dybjer

Chalmers, Data- och informationsteknik, Datavetenskap

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 9034 56-70

18th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2015
London, United Kingdom,

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-662-46678-0_4

Mer information

Senast uppdaterat

2020-05-26