Overlapping rules and logic variables in functional logic programs

Authors:
Sergio Antoy;Michael Hanus
Affiliations:
Computer Science Department, Portland State University, Portland, OR;Institut für Informatik, CAU Kiel, Kiel, Germany
Venue:
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Year:
2006

Citing 21
Cited 28

Conditional rewrite rules: Confluence and termination

Journal of Computer and System Sciences
Kernel-LEAF: a logic plus functional language

Journal of Computer and System Sciences
Rewrite systems

Handbook of theoretical computer science (vol. B)
Logic programming with functions and predicates: the language Babel

Journal of Logic Programming
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A unified computation model for functional and logic programming

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that

Term rewriting and all that
A needed narrowing strategy

Journal of the ACM (JACM)
Typed Higher-Order Narrowing without Higher-Order Strategies

FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
TOY: A Multiparadigm Declarative System

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Definitional Trees

Proceedings of the Third International Conference on Algebraic and Logic Programming
Optimal Non-deterministic Functional Logic Computations

ALP '97-HOA '97 Proceedings of the 6th International Joint 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
A semantics for tracing declarative multi-paradigm programs

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Dynamic slicing based on redex trails

Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Implementing functional logic languages using multiple threads and stores

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Translating curry to haskell system demo

Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming
Operational semantics for declarative multi-paradigm languages

Journal of Symbolic Computation
Evaluation strategies for functional logic programming

Journal of Symbolic Computation
Run-time profiling of functional logic programs

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
A virtual machine for functional logic computations

IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages

Lazy Context Cloning for Non-Deterministic Graph Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Systematic generation of glass-box test cases for functional logic programs

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Computing with subspaces

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Putting declarative programming into the web: translating curry to javascript

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A simple rewrite notion for call-time choice semantics

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Equivalence of Two Formal Semantics for Functional Logic Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Extra Variables Can Be Eliminated from Functional Logic Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Call pattern analysis for functional logic programs

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics

Applications of Declarative Programming and Knowledge Management
A Technique to Build Debugging Tools for Lazy Functional Logic Languages

Electronic Notes in Theoretical Computer Science (ENTCS)
Purely functional lazy non-deterministic programming

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Set functions for functional logic programming

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Free theorems for functional logic programs

Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Functional logic programming

Communications of the ACM
Programming with narrowing: A tutorial

Journal of Symbolic Computation
On a tighter integration of functional and logic programming

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Termination of narrowing in left-linear constructor systems

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
EasyCheck: test data for free

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Sloth - a tool for checking minimal-strictness

PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
Transforming functional logic programs into monadic functional programs

WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
KiCS2: a new compiler from Curry to Haskell

WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
From functional logic programs to purely functional programs preserving laziness

IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Goal-directed and relative dependency pairs for proving the termination of narrowing

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Purely functional lazy nondeterministic programming

Journal of Functional Programming - Dedicated to ICFP 2009
On the correctness of bubbling

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Compiling a functional logic language: the basic scheme

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
S-Narrowing for constructor systems

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Are needed redexes really needed?

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.02

Visualization

Abstract

Functional logic languages extend purely functional languages with two features: operations defined by overlapping rules and logic variables in both defining rules and expressions to evaluate. In this paper, we show that only one of these features is sufficient in a core language. On the one hand, overlapping rules can be eliminated by introducing logic variables in rules. On the other hand, logic variables can be eliminated by introducing operations defined by overlapping rules. The proposed transformations between different classes of programs not only give a better understanding of the features of functional logic programs but also may simplify implementations of functional logic languages.