This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
 W. Ackermann , Zum Hilbertschen Aufbau der reellen Zahlen, Mathematische Annalen, vol. 99 (1928), pp. 118–133.
 D. Aspinall and A. Compagnoni , Subtyping dependent types, Proceedings of the 11th annual symposium on logic in computer science (New Brunswick, New Jersey) ( E. Clarke , editor), IEEE Computer Society Press, 071996, pp. 86–97.
 J. W. Backus , Can programming be liberatedfrom the von Neuman style?, Comm. ACM, vol. 21 (1978), pp. 613–641.
 H. P. Barendregt , Enumerators of lambda terms are reducing constructively, Annals of Pure and Applied Logic, vol. 73 (1995), pp. 3–9.
 H. P. Barendregt , M. Bunder , and W. Dekkers , Systems of illative combinatory logic complete for first order propositional and predicate calculus, Journal of Symbolic Logic, vol. 58 (1993), no. 3, pp. 89–108.
 A. Berarducci and C. Böhm , A self-interpreter of lambda calculus having a normal form, Lecture Notes in Computer Science, vol. 702 (1993), pp. 85–99.
 C. Böhm and A. Berarducci , Automatic synthesis of typed λ-programs on term algebras, Theoretical Computer Science, vol. 39 (1985), pp. 135–154.
 N. G. de Bruijn , The mathematical language AUTOMATH, its usage and some of its extensions, Symposium on automatic demonstration (Berlin and New York) ( M. Laudet , D. Lacombe , and M. Schuetzenberger , editors), Lecture Notes in Mathematics, vol. 125, Springer-Verlag, 1970, pp. 29–61, also in , pp. 73–100.
 A. Church , An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58 (1936), pp. 354–363.
 A. Church and J. B. Rosser , Some properties of conversion, Transactions of the American Mathematical Society, vol. 39 (1936), pp. 472–482.
 T. Coquand and G. Huet , The calculus of constructions, Information and Computation, vol. 76 (1988), no. 2/3, pp. 95–120.
 G. Cousineau , P.-L. Curien , and M. Mauny , The categorical abstract machine, Science of Computer Programming, vol. 8 (1987), no. 2, pp. 173–202.
 H. B. Curry , Grundlagen der kombinatorischen Logik, American Journal of Mathematics, vol. 52 (1930), pp. 509–536, 789–834, in German.
 H. B. Curry , Functionality in combinatory logic, Proceedings of the National Academy of Science of the USA, vol. 20 (1934), pp. 584–590.
 H. B. Curry , Modified basic functionality in combinatory logic, Dialectica, vol. 23 (1969), pp. 83–92.
 S. Feferman , Definedness, Erkentniss, vol. 43 (1995), pp. 295–320.
 R. O. Gandy , Church's Thesis and principles for mechanisms, The Kleene symposium, North-Holland Publishing Company, Amsterdam, 1980, pp. 123–148.
 G. Gentzen , Untersuchungen über das logische Schliessen, Mathematische Zeitschrift, vol. 39 (1935), pp. 176–210, 405–431, also available in , pp 68–131.
 J.-Y. Girard , Linear logic: its syntax and semantics, Advances in linear logic ( J.-Y. Girard , Y. Lafont , and L. Regnier , editors), London Mathematical Society Lecture Note Series, Cambridge University Press, 1995, available by anonymous ftp from lmd.univ-mrs.fr as /pub/girard/Synsem.ps.Z.
 K. Grue , Map theory, Theoretical Computer Science (1992), pp. 1–133.
 R. Hindley , The principal type-scheme of an object in combinatory logic, Transactions of the American Mathematical Society, vol. 146 (1969), pp. 29–60.
 P. Hudak et al., Report on the programming language Haskell: A non-strict, purely functional language (Version 1.2), ACM SIGPLAN Notices, vol. 27 (1992), no. 5, pp. Ri–Rx, R1–R163.
 R. J. M. Hughes , Why functional programming matters, The Computer Journal, vol. 32 (1989), no. 2, pp. 98–107.
 T. Johnsson , Efficient compilation of lazy evaluation, SIGPLAN Notices, vol. 19 (1984), no. 6, pp. 58–69.
 S. C. Kleene , Lambda-definability and recursiveness, Duke Mathematical Journal, vol. 2 (1936), pp. 340–353.
 S. C. Kleene , Origins of recursive function theory, Annals of the History of Computing, vol. 3 (1981), no. 1, pp. 52–67.
 S. C. Kleene and J. B. Rosser , The inconsistency of certain formal logics, Annals of Mathematics, vol. 36 (1935), pp. 630–636.
 C. P. J. Koymans , Models of the lambda calculus, Information and Control, vol. 52 (1982), no. 3, pp. 306–323.
 J. Kuper , An axiomatic theory for partial functions, Information and Computation (1993), pp. 104–150.
 P. J. Landin , The mechanical evaluation of expressions, The Computer Journal, vol. 6 (1964), no. 4, pp. 308–320.
 R. Milner , A theory of type polymorphism in programming, Journal of Computer and System Sciences, vol. 17 (1978), pp. 348–375.
 G. D. Plotkin , Call-by-name, call-by-value and the λ-calculus, Theoretical Computer Science, vol. 1 (1975), pp. 125–159.
 J. C. Reynolds , The discoveries of continuations, LISP and Symbolic Computation, vol. 6 (1993), no. 3/4, pp. 233–247.
 R. M. Robinson , The theory of classes—a modification of von Neumann's system, Journal of Symbolic Logic, vol. 2 (1937), pp. 29–36.
 D. S. Scott , Constructive validity, Symposium on automated demonstration ( D. Lacombe , M. Laudet and M. Schuetzenberger , editors), Lecture Notes in Mathematics, vol. 125, Springer-Verlag, Berlin, 1970, pp. 237–275.
 R. K. Shyamasundar (editor), Proceedings of the 13th conference on foundations of software technology and theoretical computer science, Lecture Notes in Computer Science, vol. 761, Berlin and New York, Bombay, India, Springer-Verlag, 1993.
 M. B. Smyth and G. D. Plotkin , The category-theoretic solution of recursive domain equations, SIAM Journal on Computing, vol. 11 (1982), no. 4, pp. 761–783.
 R. Statman , The typed lambda calculus is not elementary recursive, Theoretical Computer Science, vol. 9 (1979), pp. 73–81.
 A. S. Troelstra (editor), Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer-Verlag, Berlin and New York, 1973.
 D. A. Turner , A new implementation technique for applicative languages, Software—Practice andExperience, vol. 9 (1979), pp. 31–49.
 D. A. Turner , Miranda—a non-strict functional language with polymorphic types, Functional programming languages and computer architectures (Berlin and New York) ( J. P. Jouannaud , editor), Lecture Notes in Computer Science, vol. 201, Springer-Verlag, 1985, pp. 1–16.