Extra Variables Can Be Eliminated from Functional Logic Programs

DOI10.1016/j.entcs.2006.05.049zbMath1278.68063OpenAlexW2044013129MaRDI QIDQ2867956

Francisco J. López Fraguas, Javier de Dios Castro

Publication date: 20 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.05.049

zbMATH Keywords

program transformationextra variablesfunctional logic programs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (6)

Compiling a Functional Logic Language: The Fair Scheme ⋮ Safe typing of functional logic programs with opaque patterns and local bindings ⋮ Rewriting and narrowing for constructor systems with call-time choice semantics ⋮ Termination of narrowing via termination of rewriting ⋮ Termination of Narrowing in Left-Linear Constructor Systems ⋮ Equivalence of Two Formal Semantics for Functional Logic Programs

Cites Work

• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• Operational semantics for declarative multi-paradigm languages
• Specialization of functional logic programs based on needed narrowing
• A needed narrowing strategy
• The integration of functions into logic programming: From theory to practice
• An approach to declarative programming based on a rewriting logic
• A proof theoretic approach to failure in functional logic programming
• Implementing functional logic languages using multiple threads and stores
• Overlapping Rules and Logic Variables in Functional Logic Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extra Variables Can Be Eliminated from Functional Logic Programs