A CPS-transform of constructive classical logic

DOI10.1007/3-540-46674-6_23MaRDI QIDQ4501589zbMATH OpenFDO

Authors Ichiro Ogata

Publication date 14 February 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46674-6_23

zbMATH Keywords

call-by-nameconstructive classical logiccut-eliminationdenotationnormalization for classical natural deduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Cut-elimination and normal-form theorems (03F05) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Constructive classical logic as CPS-calculus
• Cut elimination for classical proofs as continuation passing style computation
• scientific article; zbMATH DE number 1948182
• Strong normalization proofs by CPS-translations

Cited in

(5)

• A first-order one-pass CPS transformation
• Cut elimination for classical proofs as continuation passing style computation
• scientific article; zbMATH DE number 512771 (Why is no real title available?)
• scientific article; zbMATH DE number 1948182 (Why is no real title available?)
• Constructive classical logic as CPS-calculus

This page was built for publication: A CPS-transform of constructive classical logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501589)