The integration of functions into logic programming: From theory to practice
From MaRDI portal
Publication:4305632
DOI10.1016/0743-1066(94)90034-5zbMath0942.68526OpenAlexW2059799630MaRDI QIDQ4305632
Publication date: 14 August 2000
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(94)90034-5
Theory of programming languages (68N15) Logic programming (68N17) General topics in the theory of software (68N01)
Related Items (72)
Rules + strategies for transforming lazy functional logic programs ⋮ A Finite Representation of the Narrowing Space ⋮ Level-confluence of conditional rewrite systems with extra variables in right-hand sides ⋮ Implementation of a UU-algorithm for primitive recursive tree functions ⋮ Ensuring the quasi-termination of needed narrowing computations ⋮ Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ Database query languages and functional logic programming ⋮ 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 ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ A new generic scheme for functional logic programming with constraints ⋮ Programming in metric temporal logic ⋮ 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 framework for incremental learning of logic programs ⋮ Incremental learning of logic programs ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ Modular action language ⋮ Modular Termination of Basic Narrowing ⋮ Unnamed Item ⋮ The Essence of Functional Programming on Semantic Data ⋮ Operational semantics for declarative multi-paradigm languages ⋮ Evaluation strategies for functional logic programming ⋮ A compositional semantic basis for the analysis of equational Horn programs ⋮ Lazy narrowing: strong completeness and eager variable elimination ⋮ Loop detection in term rewriting using the eliminating unfoldings ⋮ Functional Logic Programming in Maude ⋮ Declaring Numbers ⋮ Canonical Ground Horn Theories ⋮ Functional Logic Programming: From Theory to Curry ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Solving Equations by Graph Transformation ⋮ Programming with narrowing: a tutorial ⋮ A framework for computing finite SLD trees ⋮ Termination of narrowing via termination of rewriting ⋮ Compiling Collapsing Rules in Certain Constructor Systems ⋮ A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains ⋮ Verifying Multithreaded Recursive Programs with Integer Variables ⋮ A compact fixpoint semantics for term rewriting systems ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Implementing conditional term rewriting by graph rewriting ⋮ Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming ⋮ Termination of Narrowing in Left-Linear Constructor Systems ⋮ Rewriting and Call-Time Choice: The HO Case ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ Applications and extensions of context-sensitive rewriting ⋮ A term-graph clausal logic: completeness and incompleteness results ★ ⋮ Functional-logic integration via minimal reciprocal extensions ⋮ Termination of narrowing revisited ⋮ On the algebraic structure of declarative programming languages ⋮ 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. ⋮ A Declarative Debugging System for Lazy Functional Logic Programs ⋮ Some characteristics of strong innermost normalization ⋮ PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION ⋮ Denotation by Transformation ⋮ Termination of Narrowing Using Dependency Pairs ⋮ Partial Functions and Equality in Answer Set Programming ⋮ 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 ⋮ Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures ⋮ Narrowing and Rewriting Logic: from Foundations to Applications ⋮ Reporting Failures in Functional Logic Programs ⋮ Implementing Relational Specifications in a Constraint Functional Logic Language ⋮ Higher-order narrowing with definitional trees ⋮ Termination by absence of infinite chains of dependency pairs
Uses Software
This page was built for publication: The integration of functions into logic programming: From theory to practice
