A new generic scheme for functional logic programming with constraints
From MaRDI portal
Publication:880985
DOI10.1007/s10990-007-9002-4zbMath1115.68048OpenAlexW2018700088MaRDI QIDQ880985
Mario Rodríguez Artalejo, Rafael del Vado Vírseda, Francisco J. López Fraguas
Publication date: 21 May 2007
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10990-007-9002-4
Related Items (5)
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP ⋮ Qualified Computations in Functional Logic Programming ⋮ A Logical Framework for Debugging in Declarative Constraint Programming ⋮ A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains ⋮ Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete and recursive feature theory
- Declarative modeling of the operational behavior of logic languages
- A rationale for conditional equational programming
- On the algebraic specification of infinite objects - ordered and continuous models of algebraic types
- On powerdomains and modality
- Conditional rewriting logic as a unified model of concurrency
- Constraint satisfaction using constraint logic programming
- A theory of type polymorphism in programming
- A feature constraint system for logic programming with entailment
- Completeness results for basic narrowing
- Rewriting logic: Roadmap and bibliography
- A model-theoretic reconstruction of the operational semantics of logic programs
- A lattice-theoretical fixpoint theorem and its applications
- A Declarative Debugging System for Lazy Functional Logic Programs
- Comparing Meseguer's Rewriting Logic with the Logic CRWL
- A complete axiomatization of a theory with feature and arity constraints
- A needed narrowing strategy
- A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Design, implementation, and evaluation of the constraint language cc(FD)
- Records for logic programming
- The s-semantics approach: Theory and applications
- The integration of functions into logic programming: From theory to practice
- An approach to declarative programming based on a rewriting logic
- Term Rewriting and All That
- Observable Semantics for Constraint Logic Programs
- Logic programming in the context of multiparadigm programming: the Oz experience
- A proof theoretic approach to failure in functional logic programming
- Functional and Logic Programming
- Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming
- Frontiers of Combining Systems
This page was built for publication: A new generic scheme for functional logic programming with constraints
