Equational logic as a programming language
Equational logic as a programming language
Strictness analysis—a practical approach
Proc. of a conference on Functional programming languages and computer architecture
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Journal of Symbolic Computation
Classes of equational programs that compile into efficient machine code
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume II: parallel languages: volume II: parallel languages
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Selected papers of the 16th international colloquium on Automata, languages, and programming
Elements of functional programming
Elements of functional programming
Lazy functional languages: abstract interpretation and compilation
Lazy functional languages: abstract interpretation and compilation
Handbook of theoretical computer science (vol. B)
Sequentiality in orthogonal term rewriting systems
Journal of Symbolic Computation
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
NV-sequentiality: a decidable condition for call-by-need computations in term-rewriting systems
SIAM Journal on Computing
Handbook of logic in computer science (vol. 2)
Programming in equational logic: beyond strong sequentiality
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Bounded, strongly sequential and forward-branching term rewriting systems
Journal of Symbolic Computation
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
A sequential reduction strategy
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that
Strongly sequential and inductively sequential term rewriting systems
Information Processing Letters
Root-neededness and approximations of neededness
Information Processing Letters
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Operational and Semantic Equivalence Between Recursive Programs
Journal of the ACM (JACM)
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Sequentiality, monadic second-order logic and tree automata
Information and Computation
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination of Context-Sensitive Rewriting by Rewriting
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Termination of (Canonical) Context-Sensitive Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Lazy Rewriting and Eager Machinery
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Termination of Context-Sensitive Rewriting
RTA '97 Proceedings of the 8th 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
Proceedings of the Third International Conference on Algebraic and Logic Programming
Recursive Path Orderings Can Be Context-Sensitive
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Complete Monotonic Semantic Path Orderings
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Strong Sequentiality of Left-Linear Overlapping Rewrite Systems
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
A Conflict Between Call-by-Need Computation and Parallelism
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
ACM SIGPLAN Notices - Special issue: History of programming languages conference
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Improving On-Demand Strategy Annotations
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Termination of (Canonical) Context-Sensitive Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Refining weakly outermost-needed rewriting and narrowing
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Strong and NV-sequentiality of constructor systems
Information Processing Letters
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Improving the Context-sensitive Dependency Graph
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Usable Rules for Context-Sensitive Rewrite Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
MTT: The Maude Termination Tool (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Improving Context-Sensitive Dependency Pairs
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Operational Termination of Membership Equational Programs: the Order-Sorted Way
Electronic Notes in Theoretical Computer Science (ENTCS)
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Web Services and Interoperability for the Maude Termination Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
Theoretical Computer Science
New Evaluation Commands for Maude Within Full Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Journal of Symbolic Computation
Correction of functional logic programs
ESOP'03 Proceedings of the 12th European conference on Programming
On the completeness of context-sensitive order-sorted specifications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Context-sensitive dependency pairs
Information and Computation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Context-sensitive dependency pairs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Generalized innermost rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Natural narrowing for general term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Generalizing newman's lemma for left-linear rewrite systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination of context-sensitive rewriting with built-in numbers and collection data structures
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
Modularity in term rewriting revisited
Theoretical Computer Science
Hi-index | 0.00 |
Contex-sensitive rewriting is a simple rewriting restriction which is formalized by imposing fixed restrictions on replacements. Such a restriction is given on a purely syntactic basis: it is given on the arguments of symbols of the signature and inductively extended to arbitrary positions of terms built from those symbols. The termination behavior is not only preserved but usually improved and several methods have been developed to formally prove it. In this paper, we investigate the definition, properties, and use of context-sensitive rewriting strategies, i.e., particular, fixed sequences of context-sensitive rewriting steps. We study how to define them in order to obtain efficient computations and to ensure that context-sensitive computations terminate whenever possible. We give conditions enabling the use of these strategies for root-normalization, normalization, and infinitary normalization. We show that this theory is suitable for formalizing the definition and analysis of real computational strategies which are used in programming languages such as OBJ or ELAN.