See this document in CiteSeerX!

A Universal Innocent Game Model For The Böhm Tree Lambda Theory  (Make Corrections)  
Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong



  Home/Search   Context   Related

 
View or download:
web.comlab.ox.ac.uk...bohmtechrep.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  web.comlab.ox.ac.u...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present a game model of the untyped -calculus, with equational theory equal to the Bohm tree -theory B, which is universal (i.e. every element of the model is de nable 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 rst syntax-independent universal models of... (Update)

Similar documents (at the sentence level):
14.4%:   More Universal Game Models of Untyped λ-Calculus: The .. - Ker, Nickau, Ong (1999)   (Correct)
7.2%:   Innocent Game Models of Untyped λ-Calculus - Ker, Nickau, Ong (1999)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Game Semantics for the Pure Lazy λ-Calculus - Di Gianantonio   (Correct)
0.3:   The Fine Structure of Game Lambda Models - Di Gianantonio, Franco   (Correct)
0.2:   Processes and Games - Honda (2003)   (Correct)

Similar documents based on text:   More   All
1.6:   Games Models of Untyped lambda-Calculus - Ker, Nickau, Ong (1998)   (Correct)
1.1:   Topic F of APPSEM - April Realisability Models   (Correct)
0.9:   Infinitary Lambda Calculus and Discrimination of.. - Dezani-Ciancaglini.. (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ ker-universal,
  author = "Andrew D. Ker and Hanno Nickau and C.-H. Luke Ong",
  title = "A Universal Innocent Game Model For The Böhm Tree Lambda Theory",
  url = "citeseer.ist.psu.edu/490148.html" }
Citations (may not include all citations):
144   Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994  ACM   DBLP
65   volume 103 of Studies in Logic and the Foundations of Mathem.. (context) - Barendregt, Calculus et al. - 1984
54   Games and Full Abstraction for a Functional Metalanguage wit.. (context) - McCusker - 1998
14   Hereditarily Sequential Functionals: A Game-Theoretic Approa.. - Nickau - 1996
13   To appear in Information and Computation (context) - Hyland, Ong et al. - 2000
7   A universal innocent game model of the Bohm tree lambda the.. (context) - Ker, Nickau et al.
5   Games and full abstraction for the lazy - calculus (context) - Abramsky, McCusker - 1995
4   Innocent Game Models of Untyped Lambda Calculus - Ker - 2001
3   Innite normal forms for the -calculus (context) - Nakajima - 1975
1   Innocent game models of untyped -calculus (context) - Ker, Nickau et al. - 2001
1   Games semantics for untyped -calculus (context) - Di Gianantonio, Franco et al. - 1998

Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/andrew.ker/./publications.html):   More
Innocent Game Models of Untyped λ-Calculus - Ker, Nickau, Ong (1999)   (Correct)
Lambda Calculus - Ker (2002)   (Correct)
Innocent game models of untyped λ-calculus - Ker, Nickau, Ong (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC