CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Game semantics and normalization by evaluation

Pierre Clairambault ; Peter Dybjer (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
Foundations of Software Science and Computation Structures; 18th International Conference, FOSSACS 2015 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)) (0302-9743). Vol. 9034 (2015), p. 56-70.
[Konferensbidrag, övrigt]

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.



Denna post skapades 2015-12-14. Senast ändrad 2016-01-07.
CPL Pubid: 228201

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)

Ämnesområden

Datalogi

Chalmers infrastruktur