Extra variables can be eliminated from functional logic programs

DOI10.1016/J.ENTCS.2006.05.049MaRDI QIDQ2867956zbMATH OpenOpenAlexFDO

Authors Javier de Dios Castro, F. J. López-Fraguas

Publication date 20 December 2013

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

extra variablesfunctional logic programsprogram transformation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Overlapping Rules and Logic Variables in Functional Logic Programs
• An Algorithm for Local Variable Elimination in Normal Logic Programs
• Elimination of local variables from definite logic programs
• Semantic determinism and functional logic program properties
• On functional symbol-free logic programs

Cites work

• A needed narrowing strategy
• A proof theoretic approach to failure in functional logic programming
• An approach to declarative programming based on a rewriting logic
• Elimination of local variables from definite logic programs
• scientific article; zbMATH DE number 1688813 (Why is no real title available?)
• scientific article; zbMATH DE number 1696583 (Why is no real title available?)
• scientific article; zbMATH DE number 1405447 (Why is no real title available?)
• scientific article; zbMATH DE number 234027 (Why is no real title available?)
• Implementing functional logic languages using multiple threads and stores
• Operational semantics for declarative multi-paradigm languages
• Overlapping Rules and Logic Variables in Functional Logic Programs
• Specialization of functional logic programs based on needed narrowing
• The integration of functions into logic programming: From theory to practice
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs

Cited in

(8)

• 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: \textit{The Fair Scheme}
• An Algorithm for Local Variable Elimination in Normal Logic Programs
• Rewriting and narrowing for constructor systems with call-time choice semantics
• Overlapping Rules and Logic Variables in Functional Logic Programs
• Termination of Narrowing in Left-Linear Constructor Systems
• Termination of narrowing via termination of rewriting

This page was built for publication: Extra variables can be eliminated from functional logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867956)