A CPS-transform of Constructive Classical Logic
by Ichiro Ogata
http://www.etl.go.jp/etl/divisions/~ogata/Drafts/asian99.ps.gz
Add To MetaCart
Abstract:
Abstract. We show that the cut-elimination for LKT, as presented in Danos et al.(1993), simulates the normalization for classical natural deduction (CND). Particularly, the denotation for CND inherits the one for LKT. Moreover the transform from CND proof (i.e., Parigot's-term) to LKT proof can be considered as a classical extension to call-by-name (CBN) CPS-transform. 1
Citations
| 378 | Untersuchungen über das logische Schliessen – Gentzen - 1934 |
| 251 | Call-by-name, call-by-value and the *-calculus – Plotkin - 1975 |
| 65 | A new deconstructive logic: Linear logic, The journal of Symbolic Logic 62 – Danos, Joinet, et al. - 1997 |
| 54 | Control categories and duality: on the categorical semantics of the λ-µ-calculus – Selinger |
| 40 | The Correspondence between Cut-Elimination and Normalization – Zucker - 1974 |
| 36 | Classical proofs as programs – Parigot - 1993 |
| 17 | A CPS-translation of the -calculus – Groote - 1994 |
| 15 | Sequent calculi for second order logic – Danos, Joinet, et al. - 1995 |
| 14 | Continuation models are universal for ��� -calculus – Hofmann, Streicher - 1997 |
| 7 | A -calculus structure ismorphic to gentzen-style sequent calculus structure – Herbelin - 1994 |
| 6 | Constructive classical logic as cps-calculus – Ogata - 2000 |
| 5 | Cut elimination for classical proofs as continuation passing style computation – Ogata - 1998 |
