A.D. Ker, H. Nickau, C.-H.L. Ong  Home/Search
Context
Related
| comlab.ox.ac.uk/pub/Documen...eac.ps.gz informatik.unisiegen.de/...eac98.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: comlab.ox.ac.uk/ou...publications (more) From: informatik.unisiegen.de/~nick... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper is a detailed description of the application of games to the construction of models of pure untyped -calculus. The strategies used are innocent in the sense of Hyland and Ong [HO94] and Nickau [Nic96]. The games used, however, are made up solely of declarations, and there is no sense of question and answer. We first construct models D and DREC as global sections of a reflexive object in the categories A I and A I REC of arenas and innocent and recursive innocent strategies... (Update)
Similar documents (at the sentence level):
13.5%: Innocent Game Models of Untyped λ-Calculus - Ker, Nickau, Ong (1999) (Correct)
5.0%: More Universal Game Models of Untyped λ-Calculus: The .. - Ker, Nickau, Ong (1999) (Correct)
Active bibliography (related documents): More All
0.3: Types for Trees - van Bakel, Barbanera.. (Correct)
0.3: Böhm's Theorem for Böhm Trees - Dezani-Ciancaglini, Intrigila, al. (Correct)
0.2: Process Semantics of Graph Reduction - Brock, Ostheimer (1995) (Correct)
Similar documents based on text: More All
1.6: A Universal Innocent Game Model For The Böhm Tree Lambda Theory - Ker, Nickau, Ong (Correct)
0.6: The Anatomy of Innocence - Danos, Harmer (2001) (Correct)
0.4: Innocent game models of untyped λ-calculus - Ker, Nickau, Ong (2002) (Correct)
BibTeX entry: (Update)
@misc{ ker-games,
author = "A.D. Ker and H. Nickau and C.-H.L. Ong",
title = "Games Models of Untyped lambda-Calculus",
url = "citeseer.ist.psu.edu/ker98games.html" }
Citations (may not include all citations):562 Categories for the Working Mathematician (context) - Lane - 1971
101 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
68 On full abstraction for PCF (context) - Hyland, Ong - 1994
65 volume 103 of Studies in Logic and the Foundations of Mathem.. (context) - Barendregt, Calculus et al. - 1984
59 The relation between computational and denotational properti.. (context) - Wadsworth - 1976
54 Games and Full Abstraction for a Functional Metalanguage wit.. (context) - McCusker - 1996
33 A syntactic characterization of the equality in some models .. (context) - Hyland - 1976
15 Theoretical Computer Science (context) - Kennaway, Klop et al. - 1997
14 Hereditarily Sequential Functionals: A Game-Theoretic Approa.. - Nickau - 1996
10 Infinite normal forms for the -calculus (context) - Nakajima - 1975
6 Infinite lambda-calculus and non-sensible models (context) - Berarducci - 1996
4 Semantics and Pragmatics of the -calculus (context) - Wadsworth - 1971
Documents on the same site (http://www.comlab.ox.ac.uk/oucl/users/luke.ong/publications.html): More
A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997) (Correct)
Non-Determinism in a Functional Setting (Extended Abstract) - Ong (1993) (Correct)
Correspondence between Operational and Denotational Semantics - Ong (1995) (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