The narrowing-driven approach to functional logic program specialization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2032417
- Specialization of functional logic programs based on needed narrowing
- Fast narrowing-driven partial evaluation for inductively sequential programs
- Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency
- scientific article; zbMATH DE number 1522991
Cites work
- A general criterion for avoiding infinite unfolding during partial deduction
- A needed narrowing strategy
- A positive supercompiler
- A Transformation System for Developing Recursive Programs
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- Higher-order narrowing with definitional trees
- scientific article; zbMATH DE number 1612493 (Why is no real title available?)
- scientific article; zbMATH DE number 1692905 (Why is no real title available?)
- scientific article; zbMATH DE number 1693041 (Why is no real title available?)
- scientific article; zbMATH DE number 1696777 (Why is no real title available?)
- scientific article; zbMATH DE number 4053011 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 108369 (Why is no real title available?)
- scientific article; zbMATH DE number 1222408 (Why is no real title available?)
- scientific article; zbMATH DE number 512892 (Why is no real title available?)
- scientific article; zbMATH DE number 1973220 (Why is no real title available?)
- scientific article; zbMATH DE number 2032417 (Why is no real title available?)
- Kernel-LEAF: A logic plus functional language
- Logic programming with functions and predicates: The language Babel
- Loop checking in partial deduction
- Partial evaluation in logic programming
- Partial evaluation of computation process -- an approach to a compiler-compiler
- Specialization of inductively sequential functional logic programs
- Term Rewriting and All That
- The concept of a supercompiler
- The integration of functions into logic programming: From theory to practice
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(18)- Partial evaluation with inference rules
- A residualizing semantics for the partial evaluation of functional logic programs.
- Conversion to tail recursion in term rewriting
- Operational semantics for declarative multi-paradigm languages
- Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency
- Narrowing and rewriting logic: from foundations to applications
- Specialization of functional logic programs based on needed narrowing
- A Finite Representation of the Narrowing Space
- Towards Erlang verification by term rewriting
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
- scientific article; zbMATH DE number 3921947 (Why is no real title available?)
- scientific article; zbMATH DE number 1222408 (Why is no real title available?)
- scientific article; zbMATH DE number 2032417 (Why is no real title available?)
- scientific article; zbMATH DE number 1522991 (Why is no real title available?)
- Polynomial-time inverse computation for accumulative functions with multiple data traversals
- Termination of Narrowing in Left-Linear Constructor Systems
- Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
- Termination of narrowing via termination of rewriting
This page was built for publication: The narrowing-driven approach to functional logic program specialization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957056)
