The integration of functions into logic programming: From theory to practice
From MaRDI portal
Cited in
(73)- Termination of narrowing revisited
- On the algebraic structure of declarative programming languages
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources
- Programming in metric temporal logic
- Functional-logic integration via minimal reciprocal extensions
- A framework for incremental learning of logic programs
- Some characteristics of strong innermost normalization
- Rules + strategies for transforming lazy functional logic programs
- Applications and extensions of context-sensitive rewriting
- A framework for computing finite SLD trees
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- Operational semantics for declarative multi-paradigm languages
- Evaluation strategies for functional logic programming
- Evaluation strategies for functional logic programming
- Declarative debugging of functional logic programs
- A debugging scheme for functional logic programs
- A declarative debugging system for lazy functional logic programs
- Failure and equality in functional logic programming
- A safe relational calculus for functional logic deductive databases
- Lazy context cloning for non-deterministic graph rewriting
- Extra variables can be eliminated from functional logic programs
- Equivalence of two formal semantics for functional logic programs
- Narrowing and rewriting logic: from foundations to applications
- Reporting failures in functional logic programs
- Implementing relational specifications in a constraint functional logic language
- Simple rectangle-based functional programs for computing reflexive-transitive closures
- The essence of functional programming on semantic data
- Cooperation of algebraic constraint domains in higher-order functional and logic programming
- A Finite Representation of the Narrowing Space
- Modular Termination of Basic Narrowing
- A term-graph clausal logic: completeness and incompleteness results ★
- Modular action language \(\mathcal{ALM}\)
- Canonical ground Horn theories
- Functional Logic Programming: From Theory to Curry
- Solving equations by graph transformation
- Needed computations shortcutting needed steps
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Higher-order narrowing with definitional trees
- Implementation of a UU-algorithm for primitive recursive tree functions
- On modularity in term rewriting and narrowing
- Higher-order narrowing with convergent systems
- Partial order programming (revisited)
- Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
- Semi-inversion of conditional constructor term rewriting systems
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
- Verifying multithreaded recursive programs with integer variables
- Prolog's control constructs in a functional setting -- axioms and implementation
- Functional logic programming in Maude
- Declaring numbers
- Termination of Narrowing in Left-Linear Constructor Systems
- Rewriting and Call-Time Choice: The HO Case
- Denotation by Transformation
- Termination of Narrowing Using Dependency Pairs
- Partial Functions and Equality in Answer Set Programming
- Compiling collapsing rules in certain constructor systems
- Termination by absence of infinite chains of dependency pairs
- The narrowing-driven approach to functional logic program specialization
- Implementing conditional term rewriting by graph rewriting
- An integrated framework for the diagnosis and correction of rule-based programs
- Incremental learning of logic programs
- Symbolic Specialization of Rewriting Logic Theories with Presto
- A compositional semantic basis for the analysis of equational Horn programs
- Lazy narrowing: strong completeness and eager variable elimination
- Data-driven runtime complexity analysis
- Ensuring the quasi-termination of needed narrowing computations
- Database query languages and functional logic programming
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- A new generic scheme for functional logic programming with constraints
- Loop detection in term rewriting using the eliminating unfoldings
- Programming with narrowing: a tutorial
- Termination of narrowing via termination of rewriting
- A compact fixpoint semantics for term rewriting systems
This page was built for publication: The integration of functions into logic programming: From theory to practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305632)
