Kernel-LEAF: a logic plus functional language
Journal of Computer and System Sciences
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Programming in equational logic: beyond strong sequentiality
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strongly sequential and inductively sequential term rewriting systems
Information Processing Letters
Induction = I-axiomatization + first-order consistency
Information and Computation - Special issue on RTA-98
Journal of the ACM (JACM)
Language Prototyping: An Algebraic Specification Approach: Vol. V
Language Prototyping: An Algebraic Specification Approach: Vol. V
Context-sensitive rewriting strategies
Information and Computation
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and 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
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Constructor-based conditional narrowing
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Refining weakly outermost-needed rewriting and narrowing
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Natural rewriting for general term rewriting systems
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Complete symbolic reachability analysis using back-and-forth narrowing
Theoretical Computer Science - Algebra and coalgebra in computer science
Higher-Order and Symbolic Computation
Narrowing and Rewriting Logic: from Foundations to Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics
Applications of Declarative Programming and Knowledge Management
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
Theoretical Computer Science
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Natural rewriting for general term rewriting systems
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Complete symbolic reachability analysis using back-and-forth narrowing
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear constructor systems. These assumptions, while reasonable for functional programming applications, are too restrictive for a much broader range of applications to which narrowing can be fruitfully applied, including applications where rules have a non-equational meaning either as transitions in a concurrent system or as inferences in a logical system. In this paper, we propose an efficient lazy narrowing strategy called natural narrowing which can be applied to general term rewriting systems with no restrictions whatsoever. An important consequence of this generalization is the wide range of applications that can now be efficiently supported by narrowing, such as symbolic model checking and theorem proving.