A new generic scheme for functional logic programming with constraints
type: Item
instance of: scholarly article
title: A new generic scheme for functional logic programming with constraints
zbMATH Open document ID: 1115.68048
author: F. J. López-Fraguas
author: M. Rodríguez Artalejo
author: R. del Vado Vírseda
published in: Higher-Order and Symbolic Computation
publication date: 2007-05-21T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 5155276
zbMATH Keywords: Functional programming
zbMATH Keywords: Logic programming
zbMATH Keywords: Constraints
describes a project that uses: GULP
describes a project that uses: CFLP
describes a project that uses: cc(FD)
describes a project that uses: SICStus
describes a project that uses: ML
describes a project that uses: Oz
describes a project that uses: TOY
MaRDI profile type: Publication
full work available at URL: s10990-007-9002-4
OpenAlex ID: W2018700088
cites work: A needed narrowing strategy
cites work: A feature constraint system for logic programming with entailment
cites work: Q4385536
cites work: Q4494367
cites work: Q4940928
cites work: Q4452630
cites work: Term Rewriting and All That
cites work: A complete axiomatization of a theory with feature and arity constraints
cites work: A complete and recursive feature theory
cites work: The s-semantics approach: Theory and applications
cites work: Q2763637
cites work: A declarative debugging system for lazy functional logic programs
cites work: Functional and Logic Programming
cites work: Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming
cites work: Q5688913
cites work: Q3716279
cites work: Q4385532
cites work: A rationale for conditional equational programming
cites work: Declarative modeling of the operational behavior of logic languages
cites work: A model-theoretic reconstruction of the operational semantics of logic programs
cites work: Q4415117
cites work: Observable Semantics for Constraint Logic Programs
cites work: An approach to declarative programming based on a rewriting logic
cites work: Q4385538
cites work: The integration of functions into logic programming: From theory to practice
cites work: Q3883561
cites work: Nondeterministic algebraic specifications and nonconfluent term rewriting
cites work: Q5287526
cites work: The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
cites work: Q3992908
cites work: Q4281598
cites work: Constraint functional logic programming revisited
cites work: Failure and equality in functional logic programming
cites work: A proof theoretic approach to failure in functional logic programming
cites work: Q4876428
cites work: Q4254883
cites work: Rewriting logic: Roadmap and bibliography
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Completeness results for basic narrowing
cites work: A theory of type polymorphism in programming
cites work: On the algebraic specification of infinite objects - ordered and continuous models of algebraic types
cites work: Comparing Meseguer's rewriting logic with the logic CRWL
cites work: Q2762632
cites work: Q3959414
cites work: Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
cites work: Records for logic programming
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
cites work: Frontiers of Combining Systems
cites work: Q4287483
cites work: Constraint satisfaction using constraint logic programming
cites work: Design, implementation, and evaluation of the constraint language cc(FD)
cites work: Logic programming in the context of multiparadigm programming: the Oz experience
cites work: On powerdomains and modality
DOI: 10.1007/S10990-007-9002-4