Proofs and programs

Synthese

Volumn 134, Issue 1-2, 2003, Pages 85-117

  Longo, Giuseppe ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34848844201     PISSN: 00397857     EISSN: 15730964     Source Type: Journal    
DOI: 10.1023/A:1022135614184     Document Type: Conference Paper

References (28)

1. Abramsky, S. et al. (eds.): 1992, Handbook of Logic in Computer Science, Vols. 1 and 2, Clarendon Press, Oxford.
2. Asperti, A. and G. Longo: 1991, Categories, Types, and Structures: An Introduction to Category Theory for the Working Computer Science, MIT Press.
3. Barendregt, H.: 1986, The Lambda Calculus, Its Syntax and Semantics, revised edition, North-Holland.
4. C. Böhm A. Berarducci 1985 Automatic Synthesis of Typed Lambda-Programs on Term Algebras Theor. Comp. Sci. 39 135 154
5. 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.
6. L. Cardelli G. Longo 1991 A Semantic Basis for Quest Journal of Functional Programming 1 2 417 458
7. Church, A.: 1941, The Calculi of Lambda Conversion, Princeton University Press.
8. T. Coquand G. Huet 1988 The Calculus of Constructions Information and Computation 76 95 120
9. J.-Y. Girard 1987 Linear Logic Theoretical Comp. Sci. 50 1 102
10. Girard, J.-Y., Y. Lafont, and R. Taylor: 1989, Proofs and Types, Cambridge University Press.
11. Girard, J.-Y.: 2001, 'Locus Solum', Mathematical Structures in Computer Science 11(3).
12. Goubault-Larrecq, J. and I. Mackie: 1997, Proof Theory and Automated Deduction, Kluwer, Dordrecht, Boston, London.
13. Hindley, J. R. and J. P. Seldin: 1980, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press.
14. Hindley, J. R. and J. P. Seldin: 1986, Introduction to Combinators and Lambda-Calculus, Cambridge University Press.
15. Lambek, J. and P. J. Scott: 1986, Introduction to Higher Order Categorical Logic, Cambridge University Press.
16. Longo, G.: 1983, 'Set-Theoretical Models of Lambda-Calculus: Theories, Expansions, Isomorphisms', Annals Pure Applied Logic 24.
17. 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.
18. G. Longo 1999 Mathematical Intelligence, Infinity and Machines: Beyond the Gödelitis Journal of Consciousness Studies 6 11 12
19. 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.
20. 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.
21. Mitchell, J. C.: 1993, Introduction to Programming Language Theory, M.I.T. Press.
22. 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.
23. Martin-Löf, P.: 1984, Intuitionistic Type Theory, Bibliopolis, Napoli.
24. J. Robinson 1965 A Machine-Oriented Logic Based on the Resolution Principle Journal of the Association for Computing Machinery 12 23 41
25. Scott, D.: 1972, 'Continuous Lattices', in Lavwere (ed.), Toposes, Algebraic Geometry and Logic, SLNM 274, Springer-Verlag, pp. 97-136.
26. D. Scott 1976 Data Types as Lattices SIAM Journal of Computing 5 522 587
27. Scott, D.: 1980, 'Lambda-Calculus, Some Models, Some Philosophy', in Barwise et al. (eds), The Kleene Symposium, North-Holland.
28. Smyth, M. and G. Plotkin: 1982, 'The Category-Theoretic Solution of Recursive Domain Equations', SIAM Journal of Computing 11.