A universal innocent game model for the Bohm tree lambda theory (1999)
Cached
Download Links
- [web.comlab.ox.ac.uk]
- [web.comlab.ox.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In Computer Science Logic: Proceedings of the 8th Annual Conference on the EACSL |
| Citations: | 3 - 3 self |
BibTeX
@INPROCEEDINGS{Ker99auniversal,
author = {Andrew D. Ker and Hanno Nickau and C. -h. Luke Ong},
title = {A universal innocent game model for the Bohm tree lambda theory},
booktitle = {In Computer Science Logic: Proceedings of the 8th Annual Conference on the EACSL},
year = {1999},
pages = {405--419},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present a game model of the untyped λ-calculus, with equational theory equal to the Böhm tree λ-theory B, which is universal (i.e. every element of the model is definable by some term). This answers a question of Di Gianantonio, Franco and Honsell. We build on our earlier work, which uses the methods of innocent game semantics to develop a universal model inducing the maximal consistent sensible theory H ∗. To our knowledge these are the first syntax-independent universal models of the untyped λ-calculus. 1
