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 50 items.
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Ensuring the quasi-termination of needed narrowing computations (Q845935) (← links)
- Database query languages and functional logic programming (Q867491) (← 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)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Programming with narrowing: a tutorial (Q968524) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources (Q1037954) (← links)
- Programming in metric temporal logic (Q1128978) (← links)
- Functional-logic integration via minimal reciprocal extensions (Q1275622) (← links)
- A framework for incremental learning of logic programs (Q1390950) (← links)
- Some characteristics of strong innermost normalization (Q1575274) (← links)
- Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (Q2347907) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- Evaluation strategies for functional logic programming (Q2456576) (← links)
- Evaluation strategies for functional logic programming (Q2841220) (← links)
- Declarative debugging of functional logic programs (Q2841221) (← links)
- A debugging scheme for functional logic programs (Q2841284) (← links)
- A declarative debugging system for lazy functional logic programs (Q2841290) (← links)
- Failure and equality in functional logic programming (Q2844060) (← links)
- A safe relational calculus for functional logic deductive databases (Q2844062) (← links)
- Lazy context cloning for non-deterministic graph rewriting (Q2867896) (← links)
- Extra variables can be eliminated from functional logic programs (Q2867956) (← links)
- Equivalence of two formal semantics for functional logic programs (Q2867964) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- Reporting failures in functional logic programs (Q2873788) (← links)
- Implementing relational specifications in a constraint functional logic language (Q2873796) (← links)
- Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures (Q2915139) (← links)
- The Essence of Functional Programming on Semantic Data (Q2988667) (← links)
- Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming (Q3067475) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- A term-graph clausal logic: completeness and incompleteness results ★ (Q3643364) (← links)
- Modular action language (Q4593024) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- Solving Equations by Graph Transformation (Q4923538) (← links)
- (Q5013811) (← links)
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides (Q5055830) (← links)
- Higher-order narrowing with definitional trees (Q5055857) (← links)
