Constructive classical logic as CPS-calculus

DOI10.1142/S0129054100000065zbMATH Open1320.03063MaRDI QIDQ5249031FDOQ5249031

Authors: Ichiro Ogata 

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1500568
• scientific article; zbMATH DE number 1070627
• scientific article; zbMATH DE number 1302630
• Programs with continuations and linear logic
• On semantics of a term calculus for classical logic

zbMATH Keywords

constructive classical logicCPS-calculusCPS-semanticsCPS-transform

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Metamathematics of constructive systems (03F50) Functional programming and lambda calculus (68N18)

Cites Work

• Untersuchungen über das logische Schliessen. I
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Linear logic
• A new constructive logic: classic logic
• The correspondence between cut-elimination and normalization
• Normalization as a homomorphic image of cut-elimination
• A new deconstructive logic: linear logic

Cited In (5)

• Classical realizability in the CPS target language
• The stack calculus
• On semantics of a term calculus for classical logic
• Title not available (Why is that?)
• Cognitive Binary Logic - The Natural Unified Formal Theory of Propositional Binary Logic

This page was built for publication: Constructive classical logic as CPS-calculus

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