Cut rules and explicit substitutions

DOI10.1017/S0960129500003273zbMath0972.68102OpenAlexW2148143203MaRDI QIDQ2713355

J. B. Wells, René Vestergaard

Publication date: 7 May 2001

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129500003273

zbMATH Keywords

intuitionistic logicrewrite ruleslogical deduction systems

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (5)

Pattern matching as cut elimination ⋮ Resource operators for \(\lambda\)-calculus ⋮ Comparing Calculi of Explicit Substitutions with Eta-reduction ⋮ Comparing and implementing calculi of explicit substitutions with eta-reduction ⋮ Strong cut-elimination in sequent calculus using Klop's ι-translation and perpetual reductions

This page was built for publication: Cut rules and explicit substitutions