A needed narrowing strategy
From MaRDI portal
Publication:3457756
DOI10.1145/347476.347484zbMath1327.68141OpenAlexW1992085465WikidataQ56214391 ScholiaQ56214391MaRDI QIDQ3457756
Rachid Echahed, Sergio Antoy, Michael Hanus
Publication date: 17 December 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/347476.347484
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Logic programming (68N17)
Related Items (51)
From Logic to Functional Logic Programs ⋮ Rules + strategies for transforming lazy functional logic programs ⋮ Strongly sequential and inductively sequential term rewriting systems ⋮ Transforming Boolean equalities into constraints ⋮ Ensuring the quasi-termination of needed narrowing computations ⋮ On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP ⋮ Constraint functional logic programming over finite domains ⋮ Complete symbolic reachability analysis using back-and-forth narrowing ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ 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 Valenciana under grant GV01-424. ⋮ Qualified Computations in Functional Logic Programming ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ A new generic scheme for functional logic programming with constraints ⋮ Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude ⋮ Two Decades of Maude ⋮ On modularity in term rewriting and narrowing ⋮ On a Tighter Integration of Functional and Logic Programming ⋮ Default rules for Curry ⋮ Functional-Logic Graph Parser Combinators ⋮ Inductively Sequential Term-Graph Rewrite Systems ⋮ Operational semantics for declarative multi-paradigm languages ⋮ Evaluation strategies for functional logic programming ⋮ Functional Logic Programming in Maude ⋮ Rewriting and narrowing for constructor systems with call-time choice semantics ⋮ Functional Logic Programming: From Theory to Curry ⋮ Polynomial-time inverse computation for accumulative functions with multiple data traversals ⋮ Solving Equations by Graph Transformation ⋮ Programming with narrowing: a tutorial ⋮ Termination of narrowing via termination of rewriting ⋮ From Boolean Equalities to Constraints ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Implementing conditional term rewriting by graph rewriting ⋮ Termination of Narrowing in Left-Linear Constructor Systems ⋮ A hybrid programming scheme combining fuzzy-logic and functional-logic resources ⋮ Evaluation Strategies for Functional Logic Programming ⋮ 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. ⋮ Reduction Strategies for Declarative Programming ⋮ A residualizing semantics for the partial evaluation of 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 <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 ⋮ Lazy Database Access with Persistent Predicates ⋮ Contextual equivalence for inductive definitions with binders in higher order typed functional programming ⋮ Higher-order narrowing with definitional trees
This page was built for publication: A needed narrowing strategy
