SCOPUS 정보 검색 플랫폼

Volumn 272, Issue 1-2, 2002, Pages 247-292

Innocent game models of untyped λ-calculus

Author keywords

Game semantics; Innocent strategies; Untyped calculus

Indexed keywords

MATHEMATICAL MODELS; SEMANTICS; TREES (MATHEMATICS);

GAME SEMANTICS;

GAME THEORY;

EID: 0037028512 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00353-4 Document Type: Conference Paper

Times cited : (14)

References (19)

1
- 85026751757
- Full abstraction for PCF (extended abstract)
- M. Hagiya, J.C. Mitchell (eds.), Theoretical Aspects of Computer Software: TACS'94, Sendai, Japan, Springer, Berlin
- (1994) Lecture Notes in Computer Science , vol.789 , pp. 1-15
- Abramsky, S.¹ Jagadeesan, R.² Malacaria, P.³

2
- 0029180147
- Games and full abstraction for the lazy λ-calculus
- IEEE Computer Society Press, Silverspring, MD
- (1995) Proc. 10th Annual IEEE Symp. on Logic in Computer Science , pp. 234-243
- Abramsky, S.¹ McCusker, G.A.²

4
- 0001702352
- Infinite lambda-calculus and non-sensible models
- A. Ursini, P. Agliano (eds.), Logic and Algebra, Marcel Dekker Inc., New York
- (1996) Lecture Notes in Pure and Applied Mathematics , vol.180 , pp. 339-378
- Berarducci, A.¹

5
- 0004020078
- Categories for types
- Cambridge University Press, Cambridge
- (1993) Cambridge Mathematical Textbooks
- Crole, R.L.¹

6
- 0013260541
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation
- (1972) Indag. Math. , vol.41 , pp. 381-392
- De Bruijn, N.G.¹

7
- 0006895632
- J.Y. Girard (Ed.), Games semantics for untyped λ-calculus, 4th Internat. Conf. TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proc., Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1581
- Di Gianantonio, P.¹ Franco, G.² Honsell, F.³

8
- 84963108491
- A syntatic characterization of the equality in some models of the lambda calculus
- (1976) J. London Math. Soc. , vol.2 , Issue.2 , pp. 361-370
- Hyland, J.M.E.¹

9
- 0000178238
- On full abstraction for PCF
- to appear
- (2000) Inform. and Comput.
- Hyland, J.M.E.¹ Ong, C.-H.L.²

10
- 0031096225
- Infinitrary lambda calculus
- (1997) Theoret. Comput. Sci. , vol.175 , pp. 93-125
- Kennaway, J.R.¹ Klop, J.W.² Sleep, M.R.³ De Vries, F.J.⁴

11
- 0006904023
- Ph.D. Thesis, University of Oxford
- (2001) Innocent game models of the untyped λ-calculus
- Ker, A.¹

12
- 84956863506
- A universal innocent game model of the Böhm tree lambda theory
- J. Flum, M. Rodríguez-Artalejo (eds.), Computer Science Logic: Proc. 8th Annual Conf. of the EACSL, Madrid, Spain, September 1999, Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1683 , pp. 405-419
- Ker, A.¹ Nickau, H.² Ong, C.-H.L.³

16
- 85035087360
- Infinite normal forms for the λ-calculus
- Springer, Berlin
- (1975) Proc. Symp. λ-calculus and Computer Science Theory , pp. 62-82
- Nakajima, R.¹

17
- 0003779377
- Shaker-Verlag, 1996. Dissertation, Universität Gesamthochschule Siegen, Shaker-Verlag, Aachen
- (1996) Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality
- Nickau, H.¹

18
- 0003792165
- Ph.D. Thesis, University of Oxford
- (1971) Semantics and pragmatics of the λ-calculus
- Wadsworth, C.P.¹

19
- 0001581867
- ∞-models of the λ-calculus
- (1976) SIAM J. Comput. , vol.5 , pp. 488-521
- Wadsworth, C.P.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.