Extra variables can be eliminated from functional logic programs
From MaRDI portal
Recommendations
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
- Functional and constraint logic programming
- Implementing functional logic languages using multiple threads and stores
- Nondeterminism in algebraic specifications and algebraic programs
- Operational semantics for declarative multi-paradigm languages
- Overlapping Rules and Logic Variables in Functional Logic Programs
- Semantics and types in functional logic programming
- Specialization of functional logic programs based on needed narrowing
- The integration of functions into logic programming: From theory to practice
- Transforming conditional rewrite systems with extra variables into unconditional systems
- 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)