Pages that link to "Item:Q4305632"
From MaRDI portal
The following pages link to The integration of functions into logic programming: From theory to practice (Q4305632):
Displaying 21 items.
- Implementation of a UU-algorithm for primitive recursive tree functions (Q5055894) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- Higher-order narrowing with convergent systems (Q5096386) (← links)
- Partial order programming (Revisited) (Q5096407) (← links)
- Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) (Q5096745) (← links)
- Semi-inversion of Conditional Constructor Term Rewriting Systems (Q5097640) (← links)
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains (Q5179011) (← links)
- Verifying Multithreaded Recursive Programs with Integer Variables (Q5179057) (← links)
- PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION (Q5249252) (← links)
- Functional Logic Programming in Maude (Q5403075) (← links)
- Declaring Numbers (Q5403480) (← links)
- Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)
- Rewriting and Call-Time Choice: The HO Case (Q5458434) (← links)
- Denotation by Transformation (Q5504595) (← links)
- Termination of Narrowing Using Dependency Pairs (Q5504664) (← links)
- Partial Functions and Equality in Answer Set Programming (Q5504669) (← links)
- Compiling Collapsing Rules in Certain Constructor Systems (Q5743585) (← links)
- Termination by absence of infinite chains of dependency pairs (Q5878910) (← links)
- The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)
- Implementing conditional term rewriting by graph rewriting (Q5958126) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
