Paper Info
Title
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 "ohm trees, and show how operations on PCF Bohm 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.
Year
DOI
Venue
2015
10.1007/978-3-662-46678-0_4
Lecture Notes in Computer Science
Field
DocType
Volume
Normalization (statistics),Bijection,Semantic domain,Computer science,Theoretical computer science,Haskell,Game semantics,Recursive data type
Conference
9034
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
11
2
Name
Order
Citations
PageRank
Pierre Clairambault16813.25
Peter Dybjer254076.99