Computational semantics of term rewriting systems
Algebraic methods in semantics
&bgr;-reductions and &bgr;-developments of &lgr;-terms with the least number of steps
COLOG-88 Proceedings of the international conference on Computer logic
Handbook of theoretical computer science (vol. B)
The clausal theory of types
Handbook of logic in computer science (vol. 2)
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
An equivalence between lambda-terms
Theoretical Computer Science
The ant-lion paradigm for strong normalization
Information and Computation
Strong normalization from weak normalization in typed &lgr;-calculi
Information and Computation
Term rewriting and all that
Semantical analysis of perpetual strategies in &lgr;-calculus
Theoretical Computer Science - Special issue: Gentzen
Perpetual reductions in &lgr;-calculus
Information and Computation
Perpetuality and uniform normalization in orthogonal rewrite systems
Information and Computation
Computing in Systems Described by Equations
Computing in Systems Described by Equations
The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Weak Orthogonality Implies Confluence: The Higher Order Case
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Some Results on the Full Abstraction Problem for Restricted Lambda Calculi
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
The Conservation Theorem revisited
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Orthogonal Higher-Order Rewrite Systems are Confluent
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Strict Functionals for Termination Proofs
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Lambda-to-CL Translation for Strong Normalization
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Polynomial Time Termination and Constraint Satisfaction Tests
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Optimal Normalization in Orthogonal Term Rewriting Systems
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Perpetuality and Uniform Normalization
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Termination Proofs for Higher-order Rewrite Systems
HOA '93 Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
On Higher Order Recursive Program Schemes
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Weak and Strong Beta Normalisations in Typed Lambda-Calculi
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Higher order recursive program schemes are Turing incomplete
Higher order recursive program schemes are Turing incomplete
Perpetual reductions in orthogonal combinatory reduction systems
Perpetual reductions in orthogonal combinatory reduction systems
Perpetual reductions and strong normalization in orthogonal term rewriting systems
Perpetual reductions and strong normalization in orthogonal term rewriting systems
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
| Hi-index | 5.23 |
We study perpetual reductions in orthogonal (or conflict-free) fully extended expression reduction systems (OERS). ERS is a formalism for rewriting that subsumes term rewriting systems (TRSs) and the &lgr;-calculus. We design a strategy that, for any given term t in a fully extended OERS, constructs a longest reduction starting from t if t is strongly normalizing and otherwise constructs an infinite reduction. We call this strategy a limit strategy. For a large class of OERSs a limit strategy is computable. The Conservation Theorem for fully extended OERSs follows easily from the properties of the strategy. We develop a method for computing the lengths of longest developments in OERSs. Copyright 2001 Elsevier Science B.V.