Development closed critical pairs

DOI10.1007/3-540-61254-8_26zbMath1407.68244OpenAlexW1761458962MaRDI QIDQ4645811

Vincent van Oostrom

Publication date: 11 January 2019

Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61254-8_26

zbMATH Keywords

lambda calculuscritical pairfunction symbolcritical intersectiondevelopment step

Mathematics Subject Classification ID

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

Related Items

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent, Developing developments, Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent, A PVS Theory for Term Rewriting Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Typed lambda calculi and applications. International conference, TLCA '93, March 16--18, 1993, Utrecht, the Netherlands. Proceedings
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Higher-order rewrite systems and their confluence
• Rewriting techniques and applications. 5th international conference RTA-93, Montréal, Canada, June 16--18, 1993. Proceedings
• Confluence by decreasing diagrams
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• Residual theory in λ-calculus: a formal development
• Logic programming with sequent systems
• Confluence and superdevelopments
• Some Properties of Conversion