Innocent Game Models of Untyped λ-Calculus (2000)

by Andrew D. Ker , Hanno Nickau , C.-H. Luke Ong
Venue:Theoretical Computer Science
Citations:3 - 1 self

Active Bibliography

1 Innocent Game Models of Untyped – Calculus Andrew Ker, Andrew D. Ker, Hanno Nickau, C. -h. Luke Ong - 2000
3 Innocent Game Models of Untyped λ-Calculus – Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong - 2000
3 A universal innocent game model for the Bohm tree lambda theory – Andrew D. Ker, Hanno Nickau, C. -h. Luke Ong - 1999
2 More Universal Game Models of Untyped λ-Calculus: The Böhm Tree Strikes Back – A. D. Ker, H. Nickau, C.-H. L. Ong - 1999
31 Games and full abstraction for nondeterministic languages – Russell S. Harmer - 1999
11 Game Semantics and Subtyping – Juliusz Chroboczek - 1999
Models and theories of λ-calculus – Giulio Manzonetto, Università Ca, Foscari Venezia - 904
Types for Trees – Steffen Van Bakel, Franco Barbanera, Mariangiola Dezani-ciancaglini, Fer-jan De Vries
Games in the Semantics of Programming Languages - An Elementary Introduction – Jan Jürjens, Benedikt L Owe, Florian Rudolph (eds, Jan J Urjens - 1999
7 Böhm's Theorem for Böhm Trees – Mariangiola Dezani-Ciancaglini, Benedetto Intrigila, Marisa Venturini-Zilli - 1998
3 A general class of models of H – Giulio Manzonetto
11 Psi-Calculi in Isabelle – Jesper Bengtson, Joachim Parrow
A Fully Game Semantics for General References – Samson Abramsky, Kohei Honda, Guy Mccusker - 1998
Fully Abstract Bidomain Models of the λ-Calculus – Jim Laird - 2001
34 Full Abstraction for Idealized Algol with Passive Expressions – Samson Abramsky, Guy Mccusker - 1998
1 Types for Trees – Franco Barbanera, Mariangiola Dezani-ciancaglini, Fer-jan De Vries - 1998
Fun and Games with the Linear lambda-Calculus – Colin J. Taylor - 1998
5 A game semantics of higher-order concurrency – J. Laird - 2006
47 Algorithmic Game Semantics – Samson Abramsky - 2001