Structural Proof Theory as Rewriting

DOI10.1007/11805618_15MaRDI QIDQ3527295zbMATH OpenOpenAlexFDO

Authors José Espírito Santo, L. Pinto, Maria João Frade

Publication date 25 September 2008

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

Full work available at URL https://doi.org/10.1007/11805618_15

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Grammars and rewriting systems (68Q42)

Recommendations

• A calculus of multiary sequent terms
• The \(\lambda \)-calculus and the unity of structural proof theory
• Refocusing Generalised Normalisation
• Cut elimination and normalization for generalized single and multi-conclusion sequent and natural deduction calculi
• scientific article; zbMATH DE number 2061717

Cited in

(9)

• Formal proofs about rewriting using ACL2
• Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications
• A calculus of multiary sequent terms
• scientific article; zbMATH DE number 2061717 (Why is no real title available?)
• Towards Formal Proof Script Refactoring
• Types for Proofs and Programs
• A faithful and quantitative notion of distant reduction for generalized applications
• Permutability in proof terms for intuitionistic sequent calculus with cuts
• The \(\lambda \)-calculus and the unity of structural proof theory

This page was built for publication: Structural Proof Theory as Rewriting

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