λμ-calculus: An algorithmic interpretation of classical natural deduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 624 LNAI, Issue , 1992, Pages 190-201

  Parigot, Michel ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84944098890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0013061     Document Type: Conference Paper

References (7)

1. T. GRIFFIN, A formulae-as-types notion of control, Proc. POPL, 1990.
2. W.A. HOWARD, The formulae as types notion of construction. Manuscript 1969. In: To H.B. Curry: Essays on combinatory logic, λ-calculus and formalism; Seidin, Hindley (eds.), Academic Press 1980.
3. J.L. KRIVINE, Opérateurs de mise en mémoire et traduction de Gödel. Archive for Mathematical Logic, 30(1990).
4. G. MURTHY, Classical proofs as programs: how, when, and why. Manuscript, 1991.
5. M. PARIGOT & J.L. KRIVINE, Programming with proofs. Presented at SCT’87. In EIK 26 (1990).
6. M. PARIGOT, Free deduction: an analysis of “computations” in classical logic. 2nd Russian Conference on Logic Programming, 1991 (to appear in LNAI).
7. D. PRAWITZ, Natural deduction. Almqvist&Wiksell, 1965.