\(\lambda\mu\)-calculus: an algorithmic interpretation of classical natural deduction. (English) Zbl 0925.03092

Parigot, Michel

Voronkov, A. (ed.), Logic programming and automated reasoning. International conference, LPAR ’92, St. Peterburg, Russia, July 15–20, 1992. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 624, 190-201 (1992).

For the entire collection see [Zbl 0916.00020].

MSC:

03B40	Combinatory logic and lambda calculus
03B70	Logic in computer science
03F05	Cut-elimination and normal-form theorems

Keywords:

proofs-as-programs paradigm; classical proofs; algorithmic content of cut-elimination; natural deduction; classical logic