On confluence for weakly normalizing systems

DOI10.1007/3-540-53904-2_98zbMath1503.68097OpenAlexW1517724578MaRDI QIDQ5055761

Pierre-Louis Curien, Giorgio Ghelli

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53904-2_98

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Collapsed tree rewriting: Completeness, confluence, and modularity, Confluence and convergence modulo equivalence in probabilistically terminating reduction systems

Cites Work

• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
• Unique normal forms for lambda calculus with surjective pairing
• The Church-Rosser theorem for the typed lambda-calculus with pairing pairing
• A framework for defining logics
• Explicit substitutions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item