A needed narrowing strategy
From MaRDI portal
Recommendations
Cited in
(69)- A hybrid programming scheme combining fuzzy-logic and functional-logic resources
- Narrowing vs. SLD-resolution
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
- A residualizing semantics for the partial evaluation of functional logic programs.
- Rules + strategies for transforming lazy functional logic programs
- Operational semantics for declarative multi-paradigm languages
- Evaluation strategies for functional logic programming
- Transforming Boolean equalities into constraints
- scientific article; zbMATH DE number 1696592 (Why is no real title available?)
- Evaluation strategies for functional logic programming
- Declarative debugging of functional logic programs
- Reduction strategies for declarative programming
- A debugging scheme for functional logic programs
- Lazy context cloning for non-deterministic graph rewriting
- Modeling pointer redirection as cyclic term-graph rewriting
- Extra variables can be eliminated from functional logic programs
- Formal properties of needed narrowing with similarity relations
- Equivalence of two formal semantics for functional logic programs
- Narrowing and rewriting logic: from foundations to applications
- Expander2: program verification between interaction and automation
- Reporting failures in functional logic programs
- Implementing dynamic-cut in \(\mathcal{T}OY\)
- Lazy database access with persistent predicates
- Contextual equivalence for inductive definitions with binders in higher order typed functional programming
- Strongly sequential and inductively sequential term rewriting systems
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
- Two Decades of Maude
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
- On a Tighter Integration of Functional and Logic Programming
- Functional-Logic Graph Parser Combinators
- Inductively Sequential Term-Graph Rewrite Systems
- scientific article; zbMATH DE number 4035204 (Why is no real title available?)
- scientific article; zbMATH DE number 4053009 (Why is no real title available?)
- scientific article; zbMATH DE number 4090771 (Why is no real title available?)
- An implementation of narrowing
- Higher-order narrowing with definitional trees
- scientific article; zbMATH DE number 1761888 (Why is no real title available?)
- Default rules for Curry
- scientific article; zbMATH DE number 826303 (Why is no real title available?)
- Functional Logic Programming: From Theory to Curry
- Solving equations by graph transformation
- From Logic to Functional Logic Programs
- Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
- Detecting redundant narrowing derivations by the LSE-SL reducibility test
- On narrowing, refutation proofs and constraints
- Higher-order narrowing with definitional trees
- On modularity in term rewriting and narrowing
- Polynomial-time inverse computation for accumulative functions with multiple data traversals
- Functional and Logic Programming
- Constraint functional logic programming over finite domains
- Qualified Computations in Functional Logic Programming
- Functional logic programming in Maude
- Rewriting and narrowing for constructor systems with call-time choice semantics
- Termination of Narrowing in Left-Linear Constructor Systems
- Term Rewriting and Applications
- From Boolean equalities to constraints
- An optimal narrowing strategy for general canonical systems
- The narrowing-driven approach to functional logic program specialization
- Implementing conditional term rewriting by graph rewriting
- An integrated framework for the diagnosis and correction of rule-based programs
- A rule-based procedure for graph query solving
- An execution model for RICE
- Nominal equational narrowing: rewriting for unification in languages with binders
- Ensuring the quasi-termination of needed narrowing computations
- Complete symbolic reachability analysis using back-and-forth narrowing
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- A new generic scheme for functional logic programming with constraints
- Programming with narrowing: a tutorial
- Termination of narrowing via termination of rewriting
This page was built for publication: A needed narrowing strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457756)
