scientific article; zbMATH DE number 2038761
From MaRDI portal
Publication:4449226
zbMath1039.03019MaRDI QIDQ4449226
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190871.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)
Related Items
Normalization in the simply typed -calculus ⋮ Programming and Proving with Classical Types ⋮ A Complete, Co-inductive Syntactic Theory of Sequential Control and State ⋮ Unnamed Item ⋮ A syntactic correspondence between context-sensitive calculi and abstract machines ⋮ Adding Negation to Lambda Mu ⋮ Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ Hypersequent calculi for intuitionistic logic with classical atoms ⋮ Linearity, Control Effects, and Behavioral Types ⋮ A proof-theoretic foundation of abortive continuations ⋮ Classical Call-by-Need and Duality ⋮ Proof Terms for Generalized Natural Deduction ⋮ A type-theoretic foundation of delimited continuations ⋮ Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi ⋮ Unnamed Item ⋮ Deriving Natural Deduction Rules from Truth Tables
