Default rules: an extension of constructive negation for narrowing-based languages
Proceedings of the eleventh international conference on Logic programming
Negation and constraint logic programming
Information and Computation
A Rewriting Logic for Declarative Programming
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Optimal Non-deterministic Functional Logic Computations
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Functional Plus Logic Programming with Built-In and Symbolic Constraints
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Extending Constructive Negation for Partial Functions in Lazy Functional-logic Languages
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
A general framework for lazy functional logic programming with algebraic polymorphic types
Theory and Practice of Logic Programming
Narrowing Failure in Functional Logic Programming
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
A logic programming approach to the verification of functional-logic programs
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative 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
Database query languages and functional logic programming
New Generation Computing
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Extra Variables Can Be Eliminated from Functional Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Set functions for functional logic programming
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Multi-paradigm declarative languages
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A complete axiomatization of strict equality
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A semantics for weakly encapsulated search in functional logic programs
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic perspective. The starting point of our work is CRWL (Constructor based ReWriting Logic), a well established theoretical framework for functional logic programming, whose fundamental notion is that of non-strict non-deterministic function. We present a proof calculus, CRWLF, which is able to deduce negative information from CRWL-programs. In particular, CRWLF is able to prove ‘finite’ failure of reduction within CRWL.