This is a preview of subscription content, log in via an institution to check access.
REFERENCES
Abramsky, S. et al. (eds.): 1992, Handbook of Logic in Computer Science, Vols. 1 and 2, Clarendon Press, Oxford.
Asperti, A. and G. Longo: 1991, Categories, Types, and Structures: An Introduction to Category Theory for the Working Computer Science, MIT Press.
Barendregt, H.: 1986, The Lambda Calculus, Its Syntax and Semantics, revised edition, North-Holland.
Böhm, C. and A. Berarducci: 1985, ‘Automatic Synthesis of Typed Lambda-Programs on Term Algebras’, Theor. Comp. Sci. 39, 135–154.
de Bruijn, N.: 1980, ‘A Survey of the Project AUTHOMATH’, in J. R. Hindley and J. P. Seldin (eds), To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, Academic Press.
Cardelli, L. and G. Longo: 1991, ‘A Semantic Basis for Quest’, Journal of Functional Programming 1(2), 417–458.
Church, A.: 1941, The Calculi of Lambda Conversion, Princeton University Press.
Coquand, T. and G. Huet: 1988, ‘The Calculus of Constructions’, Information and Computation 76, 95–120.
Girard, J.-Y.: 1987, ‘Linear Logic’, Theoretical Comp. Sci. 50, 1–102.
Girard, J.-Y., Y. Lafont, and R. Taylor: 1989, Proofs and Types, Cambridge University Press.
Girard, J.-Y.: 2001, ‘Locus Solum’, Mathematical Structures in Computer Science 11(3).
Goubault-Larrecq, J. and I. Mackie: 1997, Proof Theory and Automated Deduction, Kluwer, Dordrecht, Boston, London.
Hindley, J. R. and J. P. Seldin: 1980, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press.
Hindley, J. R. and J. P. Seldin: 1986, Introduction to Combinators and Lambda-Calculus, Cambridge University Press.
Lambek, J. and P. J. Scott: 1986, Introduction to Higher Order Categorical Logic, Cambridge University Press.
Longo, G.: 1983, ‘Set-Theoretical Models of Lambda-Calculus: Theories, Expansions, Isomorphisms’, Annals Pure Applied Logic 24.
Longo, G.: 1999a, ‘The Mathematical Continuum, from Intuition to Logic’, in J. Petitot el al. (eds), Naturalizing Phenomenology: Issues in Contemporary Phenomenology and Cognitive Sciences, Stanford University Press.
Longo G.: 1999b, ‘Mathematical Intelligence, Infinity and Machines: Beyond the Gödelitis’, Journal of Consciousness Studies, special issue on Cognition, 6, 11–12.
Longo G.: 2001a, ‘On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory’, Types' 00, Durham, December 2000, invited lecture, LNCS 2277, Springer, 2002.
Longo, G.: 2001b, ‘The Reasonable Effectiveness of Mathematics and Its Cognitive Roots’, in L. Boi (ed.), New Interactions ofMathematics with Natural Sciences, Springer, to appear.
Mitchell, J. C.: 1993, Introduction to Programming Language Theory, M.I.T. Press.
Martin-Löf, P.: 1982, ‘Constructive Logic and Computer Programming’, in L. J. Cohen et al. (eds), Logic, Methodology and Philosophy of Science VI, North-Holland, pp. 153–175.
Martin-Löf, P.: 1984, Intuitionistic Type Theory, Bibliopolis, Napoli.
Robinson, J.: 1965, ‘A Machine-Oriented Logic Based on the Resolution Principle’, Journal of the Association for Computing Machinery 12, 23–41.
Scott, D.: 1972, ‘Continuous Lattices’, in Lavwere (ed.), Toposes, Algebraic Geometry and Logic, SLNM 274, Springer-Verlag, pp. 97–136.
Scott, D.: 1976, ‘Data Types as Lattices’, SIAM Journal of Computing 5, 522–587.
Scott, D.: 1980, ‘Lambda-Calculus, Some Models, Some Philosophy’, in Barwise et al. (eds), The Kleene Symposium, North-Holland.
Smyth, M. and G. Plotkin: 1982, ‘The Category-Theoretic Solution of Recursive Domain Equations’, SIAM Journal of Computing 11.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Longo, G. Proofs and Programs. Synthese 134, 85–117 (2003). https://doi.org/10.1023/A:1022135614184
Issue Date:
DOI: https://doi.org/10.1023/A:1022135614184