Higher order conditional rewriting and narrowing
From MaRDI portal
Publication:5096313
Recommendations
Cites work
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- A logic programming language with lambda-abstraction, function variables, and simple unification
- A rationale for conditional equational programming
- Decidable higher-order unification problems
- Foundations of equational logic programming
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- Termination of combined (rewrite and λ-calculus) systems
- Termination of rewriting
- The Clausal Theory of Types
Cited in
(10)- The practice of logical frameworks
- Conditional narrowing modulo a set of equations
- scientific article; zbMATH DE number 4090852 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1088019 (Why is no real title available?)
- Higher-order narrowing with convergent systems
- scientific article; zbMATH DE number 4060702 (Why is no real title available?)
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)