|
174
|
On full abstraction for pcf
– M Hyland, L Ong
- 2000
|
|
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
|
|
65
|
Full Abstraction for PCF (Extended Abstract)
– Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan
- 1994
|
|
8
|
Evolving Games and Essential Nets for Affine Polymorphism
– A. S. Murawski, C.-H. L. Ong
|
|
197
|
Games and Full Completeness for Multiplicative Linear Logic
– Samson Abramsky, Radha Jagadeesan
- 1994
|
|
25
|
Dialogues as a foundation for intuitionistic logic
– W Felscher
- 1986
|
|
173
|
Full Abstraction for PCF
– Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- 1996
|
|
3
|
Innocent Game Models of Untyped λ-Calculus
– Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong
- 2000
|
|
7
|
Games semantics for untyped - calculus
– P Di Gianantonio, G Franco, F Honsell
- 1998
|
|
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
|
|
28
|
Full abstraction in the lazy -calculus
– S Abramsky, L Ong
- 1989
|
|
137
|
The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition
– H P Barendregt
- 1984
|
|
5
|
Infinite normal forms for the λ-calculus
– Reiji Nakajima
- 1975
|
|
23
|
On full abstraction for
– Judy E, Judy E. Scott, Guy G Gable
- 1994
|
|
46
|
Games and full abstraction for a functional metalanguage with recursive types. Distinguished Dissertation Series
– G McCusker
- 1998
|
|
266
|
The Lambda Calculus: its syntax and semantics, volume 103 of Studies in logic and the foundations of mathematics
– Henk Barendregt
- 1985
|
|
5
|
A fully-complete PER model for ML polymorphic types
– S Abramsky, M Lenisa
- 2000
|
