Typed Lambda Calculi and Applications
From MaRDI portal
Publication:5704013
DOI10.1007/b135690zbMath1114.03005OpenAlexW2501230561MaRDI QIDQ5704013
François Lamarche, Lutz Straßburger
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135690
Cut-elimination and normal-form theorems (03F05) Classical propositional logic (03B05) Structure of proofs (03F07)
Related Items (8)
Categorical proof theory of classical propositional calculus ⋮ Combinatorial flows as bicolored atomic flows ⋮ Classical proof forestry ⋮ Proof nets for classical logic ⋮ Towards Hilbert's 24th Problem: Combinatorial Proof Invariants ⋮ A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Unnamed Item
This page was built for publication: Typed Lambda Calculi and Applications