Extra Variables Can Be Eliminated from Functional Logic Programs

DOI10.1016/j.entcs.2006.05.049zbMath1278.68063MaRDI 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 transformation; extra variables; functional logic programs

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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