The narrowing-driven approach to functional logic program specialization

DOI10.1007/BF03037257zbMath1016.68024OpenAlexW2127788730MaRDI QIDQ5957056

Germán Vidal, Elvira Albert

Publication date: 27 May 2002

Published in: New Generation Computing (Search for Journal in Brave)

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

zbMATH Keywords

partial evaluationnarrowingprogram optimization

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (10)

A Finite Representation of the Narrowing Space ⋮ Towards Erlang Verification by Term Rewriting ⋮ Conversion to tail recursion in term rewriting ⋮ Operational semantics for declarative multi-paradigm languages ⋮ Polynomial-time inverse computation for accumulative functions with multiple data traversals ⋮ Termination of narrowing via termination of rewriting ⋮ A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs ⋮ Termination of Narrowing in Left-Linear Constructor Systems ⋮ A residualizing semantics for the partial evaluation of functional logic programs. ⋮ Narrowing and Rewriting Logic: from Foundations to Applications

Uses Software

• BABEL
• ECCE
• Kernel-LEAF
• TOY
• PAKCS
• Refal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general criterion for avoiding infinite unfolding during partial deduction
• Partial evaluation of computation process -- an approach to a compiler-compiler
• Kernel-LEAF: A logic plus functional language
• Specialization of inductively sequential functional logic programs
• A needed narrowing strategy
• The concept of a supercompiler
• Partial evaluation in logic programming
• Logic programming with functions and predicates: The language Babel
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• A Transformation System for Developing Recursive Programs
• Higher-order narrowing with definitional trees
• The integration of functions into logic programming: From theory to practice
• A positive supercompiler
• Term Rewriting and All That
• Conjunctive partial deduction: foundations, control, algorithms, and experiments
• Loop checking in partial deduction
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

This page was built for publication: The narrowing-driven approach to functional logic program specialization