On the correspondence between two classes of reduction systems
Information Processing Letters
Equational logic as a programming language
Equational logic as a programming language
Revised report on the algorithmic language scheme
ACM SIGPLAN Notices
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Optimizing equational programs
on Rewriting techniques and applications
The categorical abstract machine
Science of Computer Programming
CLEAN: A language for functional graph rewriting
Proc. of a conference on Functional programming languages and computer architecture
Implementing first-order rewriting with constructor systems (Note)
Theoretical Computer Science
Compiling equational programs into efficient machine code
Compiling equational programs into efficient machine code
Non-strict languages-programming and implementation
The Computer Journal - Special issue on Lazy functional programming
Classes of equational programs that compile into efficient machine code
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Term-rewriting systems with rule priorities
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
The specificity rule for lazy pattern-matching in ambiguous term rewrite systems
Proceedings of the third European symposium on programming on ESOP '90
The spineless tagless G-machine
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Parallel graph reduction with the (v , G)-machine
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Left-to-right tree pattern matching
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Lazy functional languages: abstract interpretation and compilation
Lazy functional languages: abstract interpretation and compilation
Optimization of equational programs using partial evaluation
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Constructor equivalent term rewriting systems
Information Processing Letters
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Call-by-need and continuation-passing style
Lisp and Symbolic Computation
Bounded, strongly sequential and forward-branching term rewriting systems
Journal of Symbolic Computation
Transformations and confluence for rewrite systems
Theoretical Computer Science
Help, a fast interactive lazy functional language system
Help, a fast interactive lazy functional language system
Efficient simulation of forward-branching systems with constructor systems
Journal of Symbolic Computation
On the power and limitations of strictness analysis
Journal of the ACM (JACM)
Term rewriting and all that
Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Thunks: a way of compiling procedure statements with some comments on procedure declarations
Communications of the ACM
Efficient compilation of lazy evaluation
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Uniprocessor Garbage Collection Techniques
IWMM '92 Proceedings of the International Workshop on Memory Management
Simulation as a Correct Transformation of Rewrite Systems
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Minimal Term Rewriting Systems
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Implementation of Term Rewritings with the Evaluation Strategy
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
WSA '93 Proceedings of the Third International Workshop on Static Analysis
Lazy Rewriting and Eager Machinery
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
EPIC: An Equational Language -Abstract Machine Supporting Tools-
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
The Theory and Practice of Transforming Call-by-need into Call-by-value
Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Fundamentals of Context=Sensitive Rewriting
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Epic and ARM -- user''s guide --
Epic and ARM -- user''s guide --
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Context-sensitive rewriting strategies
Information and Computation
Improving On-Demand Strategy Annotations
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Termination of on-demand rewriting and termination of OBJ programs
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Refining weakly outermost-needed rewriting and narrowing
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Proving termination of context-sensitive rewriting by transformation
Information and Computation
An Account of Implementing Applicative Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Functions and Lazy Evaluation in Prolog
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of Lazy Rewriting Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
Theoretical Computer Science
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
Generalized innermost rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Modularity in term rewriting revisited
Theoretical Computer Science
| Hi-index | 0.00 |
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, redundant rewrite steps are avoided, and the termination behavior of a term-rewriting system can be improved. Some transformations of rewrite rules enable an implementation using the same primitives as an implementation of eager rewriting.