This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T. GRIFFIN, A formulae-as-types notion of control, Proc. POPL, 1990.
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.
J.L. KRIVINE, Opérateurs de mise en mémoire et traduction de Gödel. Archive for Mathematical Logic, 30(1990).
G. MURTHY, Classical proofs as programs: how, when, and why. Manuscript, 1991.
M. PARIGOT & J.L. KRIVINE, Programming with proofs. Presented at SCT'87. In EIK 26 (1990).
M. PARIGOT, Free deduction: an analysis of “computations” in classical logic. 2nd Russian Conference on Logic Programming, 1991 (to appear in LNAI).
D. PRAWITZ, Natural deduction. Almqvist&Wiksell, 1965.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parigot, M. (1992). λμ-Calculus: An algorithmic interpretation of classical natural deduction. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013061
Download citation
DOI: https://doi.org/10.1007/BFb0013061
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55727-2
Online ISBN: 978-3-540-47279-7
eBook Packages: Springer Book Archive