Higher-order narrowing with definitional trees
From MaRDI portal
Recommendations
Cited in
(26)- A residualizing semantics for the partial evaluation of functional logic programs.
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Counterexamples in infinitary rewriting with non-fully-extended rules
- Dynamic slicing of lazy functional programs based on redex trails
- Operational semantics for declarative multi-paradigm languages
- Evaluation strategies for functional logic programming
- scientific article; zbMATH DE number 1696604 (Why is no real title available?)
- Evaluation strategies for functional logic programming
- Declarative debugging of functional logic programs
- Reduction strategies for declarative programming
- A debugging scheme for functional logic programs
- Equivalence of two formal semantics for functional logic programs
- Transforming functional logic programs into monadic functional programs
- A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
- scientific article; zbMATH DE number 515736 (Why is no real title available?)
- Functional Logic Programming: From Theory to Curry
- Higher-order narrowing with definitional trees
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
- Decidable higher-order unification problems
- Functional and Logic Programming
- Rewriting and Call-Time Choice: The HO Case
- Infinitary combinatory reduction systems
- The narrowing-driven approach to functional logic program specialization
- An integrated framework for the diagnosis and correction of rule-based programs
- Nominal equational narrowing: rewriting for unification in languages with binders
This page was built for publication: Higher-order narrowing with definitional trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256147)
