Game semantics and normalization by evaluation
Konferensbidrag (offentliggjort, men ej förlagsutgivet), 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

0302-9743 (ISSN)

Vol. 9034 56-70

Ämneskategorier

Datavetenskap (datalogi)

DOI

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

ISBN

978-3-662-46677-3

Mer information

Skapat

2017-10-07