A new generic scheme for functional logic programming with constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1688813 (Why is no real title available?)
- scientific article; zbMATH DE number 1692897 (Why is no real title available?)
- scientific article; zbMATH DE number 3945331 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1312992 (Why is no real title available?)
- scientific article; zbMATH DE number 512892 (Why is no real title available?)
- scientific article; zbMATH DE number 549964 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 1142322 (Why is no real title available?)
- scientific article; zbMATH DE number 1954119 (Why is no real title available?)
- scientific article; zbMATH DE number 2048606 (Why is no real title available?)
- scientific article; zbMATH DE number 1487843 (Why is no real title available?)
- scientific article; zbMATH DE number 873325 (Why is no real title available?)
- scientific article; zbMATH DE number 1407673 (Why is no real title available?)
- scientific article; zbMATH DE number 234027 (Why is no real title available?)
- scientific article; zbMATH DE number 970727 (Why is no real title available?)
- A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
- A complete and recursive feature theory
- A complete axiomatization of a theory with feature and arity constraints
- A declarative debugging system for lazy functional logic programs
- A feature constraint system for logic programming with entailment
- A lattice-theoretical fixpoint theorem and its applications
- A model-theoretic reconstruction of the operational semantics of logic programs
- A needed narrowing strategy
- A proof theoretic approach to failure in functional logic programming
- A rationale for conditional equational programming
- A theory of type polymorphism in programming
- An approach to declarative programming based on a rewriting logic
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Comparing Meseguer's rewriting logic with the logic CRWL
- Completeness results for basic narrowing
- Conditional rewriting logic as a unified model of concurrency
- Constraint functional logic programming revisited
- Constraint satisfaction using constraint logic programming
- Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming
- Declarative modeling of the operational behavior of logic languages
- Design, implementation, and evaluation of the constraint language cc(FD)
- Failure and equality in functional logic programming
- Frontiers of Combining Systems
- Functional and Logic Programming
- Logic programming in the context of multiparadigm programming: the Oz experience
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Observable Semantics for Constraint Logic Programs
- On powerdomains and modality
- On the algebraic specification of infinite objects - ordered and continuous models of algebraic types
- Records for logic programming
- Rewriting logic: Roadmap and bibliography
- Term Rewriting and All That
- The integration of functions into logic programming: From theory to practice
- The s-semantics approach: Theory and applications
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
Cited in
(10)- Constraint functional logic programming revisited
- Qualified Computations in Functional Logic Programming
- Frontiers of Combining Systems
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
- A logical framework for debugging in declarative constraint programming
- scientific article; zbMATH DE number 4128359 (Why is no real title available?)
- A concurrent operational semantics for constraint functional logic programming
- A functorial framework for constraint normal logic programming
- Cooperation of algebraic constraint domains in higher-order functional and logic programming
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
This page was built for publication: A new generic scheme for functional logic programming with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880985)