Higher-order narrowing with definitional trees
From MaRDI portal
Publication:4256147
DOI10.1017/S0956796899003330zbMath0926.68028OpenAlexW2013131987MaRDI QIDQ4256147
Christian Prehofer, Michael Hanus
Publication date: 28 June 1999
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796899003330
Related Items (20)
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. ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ Counterexamples in infinitary rewriting with non-fully-extended rules ⋮ Operational semantics for declarative multi-paradigm languages ⋮ Evaluation strategies for functional logic programming ⋮ Transforming Functional Logic Programs into Monadic Functional Programs ⋮ Functional Logic Programming: From Theory to Curry ⋮ Infinitary combinatory reduction systems ⋮ A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains ⋮ Dynamic slicing of lazy functional programs based on redex trails ⋮ The narrowing-driven approach to functional logic program specialization ⋮ A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs ⋮ Rewriting and Call-Time Choice: The HO Case ⋮ Decidable higher-order unification problems ⋮ 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. ⋮ Perpetuality and uniform normalization in orthogonal rewrite systems ⋮ Equivalence of Two Formal Semantics for Functional Logic Programs
This page was built for publication: Higher-order narrowing with definitional trees
