Minimal classical logic and control operators

DOI10.1007/3-540-45061-0_68MaRDI QIDQ4449226zbMATH OpenFDO

Authors Zena M. Ariola, Hugo Herbelin

Publication date 8 February 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190871.htm

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• A proof-theoretic foundation of abortive continuations
• scientific article; zbMATH DE number 512771
• scientific article; zbMATH DE number 1231511
• Calculus of classical proofs. I
• scientific article; zbMATH DE number 2038177

Cited in

(17)

• Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi
• A proof-theoretic foundation of abortive continuations
• Linearity, control effects, and behavioral types
• Classical call-by-need and duality
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
• Continuation calculus
• Programming and Proving with Classical Types
• scientific article; zbMATH DE number 7204446 (Why is no real title available?)
• Deriving natural deduction rules from truth tables
• Unifying classical and intuitionistic logics for computational control
• Normalization in the simply typed -calculus
• Proof Terms for Generalized Natural Deduction
• Adding Negation to Lambda Mu
• Hypersequent calculi for intuitionistic logic with classical atoms
• A syntactic correspondence between context-sensitive calculi and abstract machines
• A type-theoretic foundation of delimited continuations

This page was built for publication: Minimal classical logic and control operators

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