A formal system of reduction paths for parallel reduction

DOI10.1016/J.TCS.2020.01.002zbMath1433.68190OpenAlexW2998883920WikidataQ126384233 ScholiaQ126384233MaRDI QIDQ1989338

Ken-etsu Fujita

Publication date: 21 April 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.01.002

zbMATH Keywords

plane graphquiverparallel reductionChurch-Rosser theorem\( \lambda \)-calculusTakahashi translation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Z property for the shuffling calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositional Z: confluence proofs for permutative conversion
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lectures on the Curry-Howard isomorphism
• Complete rewriting systems and homology of monoid algebras
• The typed lambda-calculus is not elementary recursive
• The Church-Rosser theorem and quantitative analysis of witnesses
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• A simplified proof of the Church-Rosser theorem
• Finitary higher inductive types in the groupoid model
• Exact bounds for lengths of reductions in typed λ-calculus
• Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus
• Parallel reductions in \(\lambda\)-calculus

This page was built for publication: A formal system of reduction paths for parallel reduction