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

Documents Related by Co-Citation

197 On full abstraction for PCF – J M E Hyland, C H L Ong
48 Games and full abstraction for a functional metalanguage with recursive types – G McCusker - 1996
4 Recursive Types in Games: Axiomatics and Process Representation (Extended Abstract) – Marcelo Fiore, Kohei Honda - 1998
14 Computing with abstract Böhm trees – P-L Curien, H Herbelin - 1998
117 A fully abstract game semantics for general references – S Abramsky, K Honda, G McCusker - 1998
61 Full Abstraction for Functional Languages with Control – James Laird - 1997
7 Games semantics for untyped - calculus – P Di Gianantonio, G Franco, F Honsell - 1998
3 Innocent Game Models of Untyped λ-Calculus – Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong - 2000
2 Game Semantics for Untyped λcalculus – P Di Gianantonio, G Franco, F Honsell - 1999
9 Infinite normal forms for the -calculus – Reiji Nakajima - 1975
5 Innocent game models of untyped - calculus – A D Ker, H Nickau, C-H L Ong
15 Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality – Hanno Nickau, Doktors Der Naturwissenschaften, Dipl. --math Hanno Nickau, Angenommen Vom Fachbereich, Dekan Prof, Dr. Franz-jurgen Delvos - 1996
28 Full abstraction in the lazy -calculus – S Abramsky, L Ong - 1989
66 Full Abstraction for PCF (Extended Abstract) – Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan - 1994
7 Infinite normal forms for the λ-calculus – R Nakajima - 1975
26 On full abstraction for – Judy E, Judy E. Scott, Guy G Gable - 1994
282 The Lambda Calculus – Its Syntax and Semantics, volume 103 of – Hendrik Pieter Barendregt - 1984
154 The Lambda Calculus: its Syntax and Semantics. NorthHolland, revised edition – H P Barendregt - 1984
1 Game semantics for untyped - calculus – F - 1998