De Bruijn's weak diamond property revisited

DOI10.1016/J.INDAG.2013.08.005zbMath1360.68533OpenAlexW2089961511MaRDI QIDQ740482

Jörg Endrullis, Jan Willem Klop

Publication date: 3 September 2014

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.indag.2013.08.005

zbMATH Keywords

confluenceterm rewritinglambda calculusdecreasing diagramsAutomath projectweak diamond property

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Transducer degrees: atoms, infima and suprema ⋮ Braids via term rewriting ⋮ Unnamed Item ⋮ Decreasing diagrams with two labels are complete for confluence of countable systems ⋮ Unnamed Item

Uses Software

• CSI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decreasing diagrams and relative termination
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lectures on the Curry-Howard isomorphism
• Diagram techniques for confluence
• Confluence by decreasing diagrams
• Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
• On theories with a combinatorial definition of 'equivalence'
• Confluence by Decreasing Diagrams
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A geometric proof of confluence by decreasing diagrams
• CSI – A Confluence Tool
• Labelings for Decreasing Diagrams.

This page was built for publication: De Bruijn's weak diamond property revisited