Higher order conditional rewriting and narrowing

DOI10.1007/BFb0016859zbMath1495.68107OpenAlexW1515796742MaRDI QIDQ5096313

Carlos Loría-Sáenz, Jürgen Avenhaus

Publication date: 16 August 2022

Published in: Constraints in Computational Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0016859

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Related Items (5)

Higher-order narrowing with convergent systems ⋮ On the confluence of lambda-calculus with conditional rewriting ⋮ Shallow confluence of conditional term rewriting systems ⋮ Higher-order narrowing with definitional trees ⋮ The practice of logical frameworks

Cites Work

• A rationale for conditional equational programming
• Termination of rewriting
• Simplifying conditional term rewriting systems: Unification, termination and confluence
• Foundations of equational logic programming
• A logic programming language with lambda-abstraction, function variables, and simple unification
• Decidable higher-order unification problems
• Termination of combined (rewrite and λ-calculus) systems
• The Clausal Theory of Types
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Higher order conditional rewriting and narrowing