Statistical properties of simple types

Mathematical Structures in Computer Science

Volumn 10, Issue 5, 2000, Pages 575-594

  Moczurad, M ^a   Tyszkiewicz, J ^b   Zaionc, M ^b  

^a JAGIELLONIAN UNIVERSITY   (Poland)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18944361985     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129599002959     Document Type: Article

References (7)

1. Barendregt, H. P. (1984) The lambda calculus. Its syntax and semantics. Revised edition. Studies in Logic and the Foundations of Mathematics 103, North-Holland.
2. Comtet, L. (1974) Advanced combinatorics. The art of finite and infinite expansions (revised and enlarged edition), Reidel, Dordrecht.
3. Hindley, J. R. (1997) Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science 42, Cambridge University Press.
4. Statman, R. (1980) On the existence of closed terms in the typed λ-calculus. In: Hindley, J. R. and Seldin, J. (eds.) Combinatory Logic, Lambda Calculus and Formalism, Academic Press.
5. Szego, G. (1975) Orthogonal polynomials (fourth edition). AMS, Colloquium Publications 23.
6. Wolfram, D.A. (1993) The Clausual Theory of Types. Cambridge Tracts in Theoretical Computer Science 21, Cambridge University Press.
7. Wilf, H. S. (1994) Generatingfunctionology (second edition), Academic Press.