A Characterization of Medial as Rewriting Rule
From MaRDI portal
Publication:5432350
DOI10.1007/978-3-540-73449-9_26zbMath1203.68079OpenAlexW2160595899MaRDI QIDQ5432350
Publication date: 2 January 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_26
Related Items (7)
Combinatorial flows as bicolored atomic flows ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Enumerating Independent Linear Inferences ⋮ On linear rewriting systems for Boolean logic and some applications to proof theory ⋮ A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs ⋮ Unnamed Item ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
This page was built for publication: A Characterization of Medial as Rewriting Rule
