The following pages link to A needed narrowing strategy (Q3457756):
Displayed 50 items.
- Strongly sequential and inductively sequential term rewriting systems (Q293294) (← links)
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Ensuring the quasi-termination of needed narrowing computations (Q845935) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- Programming with narrowing: a tutorial (Q968524) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources (Q1037954) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- A residualizing semantics for the partial evaluation of functional logic programs. (Q1853170) (← links)
- Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- Evaluation strategies for functional logic programming (Q2456576) (← links)
- Transforming Boolean equalities into constraints (Q2628300) (← links)
- Evaluation Strategies for Functional Logic Programming (Q2841220) (← links)
- Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424. (Q2841221) (← links)
- Reduction Strategies for Declarative Programming (Q2841228) (← links)
- A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenci (Q2841284) (← links)
- Lazy Context Cloning for Non-Deterministic Graph Rewriting (Q2867896) (← links)
- Modeling Pointer Redirection as Cyclic Term-graph Rewriting (Q2867899) (← links)
- Extra Variables Can Be Eliminated from Functional Logic Programs (Q2867956) (← links)
- Formal Properties of Needed Narrowing with Similarity Relations (Q2867957) (← links)
- Equivalence of Two Formal Semantics for Functional Logic Programs (Q2867964) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- Expander2: Program Verification Between Interaction and Automation (Q2873787) (← links)
- Reporting Failures in Functional Logic Programs (Q2873788) (← links)
- Implementing Dynamic-Cut in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">T</mml:mi></mml:math>OY (Q2873795) (← links)
- Lazy Database Access with Persistent Predicates (Q2873797) (← links)
- Contextual equivalence for inductive definitions with binders in higher order typed functional programming (Q2875221) (← links)
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
- Two Decades of Maude (Q2945709) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)
- On a Tighter Integration of Functional and Logic Programming (Q3498436) (← links)
- Functional-Logic Graph Parser Combinators (Q3522023) (← links)
- Inductively Sequential Term-Graph Rewrite Systems (Q3540390) (← links)
- Default rules for Curry (Q4593082) (← links)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- Solving Equations by Graph Transformation (Q4923538) (← links)
- From Logic to Functional Logic Programs (Q5038460) (← links)
- Higher-order narrowing with definitional trees (Q5055857) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- Constraint functional logic programming over finite domains (Q5309079) (← links)
- Qualified Computations in Functional Logic Programming (Q5325770) (← links)
- Functional Logic Programming in Maude (Q5403075) (← links)
- Rewriting and narrowing for constructor systems with call-time choice semantics (Q5410729) (← links)
- Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)
- From Boolean Equalities to Constraints (Q5743586) (← links)
- The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)