Higher order conditional rewriting and narrowing

DOI10.1007/BFB0016859zbMATH Open1495.68107OpenAlexW1515796742MaRDI QIDQ5096313FDOQ5096313

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

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

Recommendations

• Higher-order narrowing with convergent systems
• Conditional narrowing modulo a set of equations
• scientific article; zbMATH DE number 1038528
• A rationale for conditional equational programming
• scientific article; zbMATH DE number 1696604

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Conditional narrowing modulo a set of equations
• Title not available (Why is that?)
• On the confluence of lambda-calculus with conditional rewriting
• Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
• Higher-order narrowing with definitional trees
• Shallow confluence of conditional term rewriting systems
• Title not available (Why is that?)
• Higher-order narrowing with convergent systems
• Title not available (Why is that?)
• The practice of logical frameworks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096313)