Equational logic as a programming language
Equational logic as a programming language
Lambda lifting: transforming programs to recursive equations
Proc. of a conference on Functional programming languages and computer architecture
Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Design and implementation of a generic, logic and functional programming language
Proc. of the European symposium on programming on ESOP 86
Algebraic specifications of computable and semicomputable data types
Theoretical Computer Science
Notes on the elimination of conditions
1st international workshop on Conditional Term Rewriting Systems
A rationale for conditional equational programming
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Kernel-LEAF: a logic plus functional language
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
Handbook of logic in computer science (vol. 2)
Term rewriting and all that
Strongly sequential and inductively sequential term rewriting systems
Information Processing Letters
Journal of Symbolic Computation
Journal of the ACM (JACM)
Compiling Logic Programs with Equality
PLILP '90 Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming
A Demand Driven Computation Strategy for Lazy Narrowing
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Unravelings and Ultra-properties
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
How to Transform Canonical Decreasing CTRSs into Equivalent Canonical TRSs
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Lazy Narrowing in a Graph Machine
Proceedings of the Second International Conference on Algebraic and Logic Programming
Constructor-based conditional narrowing
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
An implementation of narrowing strategies
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
New completeness results for lazy conditional narrowing
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Transformation for Refining Unraveled Conditional Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
From conditional to unconditional rewriting
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Computationally equivalent elimination of conditions
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Hi-index | 0.00 |
We present a new evaluation strategy for functional logic programs described by weakly orthogonal conditional term rewriting systems. Our notion of weakly orthogonal conditional rewrite system extends a notion of Bergstra and Klop and covers a large part of programs defined by conditional equations. Our strategy combines the flexibility of logic programming (computation of solutions for logic variables) with efficient evaluation methods from functional programming. In particular, it is the first known narrowing strategy for this class of programs that evaluates ground terms deterministically. This is achieved by a transformation of conditional term rewriting systems (CTRS) into unconditional ones which is sound and complete w.r.t. the semantics of the original CTRS. We show that the transformation preserves weak orthogonality for the terms of interest. This property allows us to apply a relatively efficient evaluation strategy for weakly orthogonal unconditional term rewriting systems (parallel narrowing) on the transformed programs.