Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
Journal of Symbolic Computation
Models and equality for logical programming
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
A rationale for conditional equational programming
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
A new deductive approach to planning
New Generation Computing
Kernel-LEAF: a logic plus functional language
Journal of Computer and System Sciences
The gamma model and its discipline of programming
Science of Computer Programming
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Basic category theory for computer scientists
Basic category theory for computer scientists
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
Nondeterministic algebraic specifications and nonconfluent term rewriting
Journal of Logic Programming
Implementation of subset-equational programs
Journal of Logic Programming
Programming by multiset transformation
Communications of the ACM
Nondeterminism in algebraic specifications and algebraic programs
Nondeterminism in algebraic specifications and algebraic programs
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Embedding extensional finite sets in CLP
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Lazy narrowing: strong completeness and eager variable elimination
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
A lazy narrowing calculus for functional logic programming with algebraic polymorphic types
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Proving termination with multiset orderings
Communications of the ACM
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Rewriting Logic for Declarative Programming
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
A Functional and Logic Language with Polymorphic Types (Extended Abstract)
DISCO '90 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
A Demand Driven Computation Strategy for Lazy Narrowing
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Embedding Multiset Constraints into a Lazy Functional Logic Language
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Multiparadigm Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Lazy Narrowing with Parametric Order Sorted Types
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
A Refined Version of General E-Unification
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Lazy narrowing with simplification
Computer Languages
Functional and constraint logic programming
Constraints in computational logics
Integrating finite domain constraints and CLP with sets
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A proof theoretic approach to failure in functional logic programming
Theory and Practice of Logic Programming
A lazy narrowing calculus for declarative constraint programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Designing an efficient computation strategy in CFLP(FD) using definitional trees
Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming
Theory and Practice of Logic Programming
A comparison between two logical formalisms for rewriting
Theory and Practice of Logic Programming
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
We propose a general framework for first-order functional logic programming, supporting lazy functions, non-determinism and polymorphic datatypes whose data constructors obey a set 𝒞 of equational axioms. On top of a given 𝒞, we specify a program as a set ℛ of 𝒞-based conditional rewriting rules for defined functions. We argue that equational logic does not supply the proper semantics for such programs. Therefore, we present an alternative logic which includes 𝒞-based rewriting calculi and a notion of model. We get soundness and completeness for 𝒞-based rewriting w.r.t. models, existence of free models for all programs, and type preservation results. As operational semantics, we develop a sound and complete procedure for goal solving, which is based on the combination of lazy narrowing with unification modulo 𝒞. Our framework is quite expressive for many purposes, such as solving action and change problems, or realizing the GAMMA computation model.