Towards an intermediate language based on graph rewriting
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Algebraic theory of processes
Handbook of logic in computer science (vol. 2)
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
The adequacy of term graph rewriting for simulating term rewriting
Term graph rewriting
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A call-by-need lambda calculus
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
Properties of a first-order functional language with sharing
Theoretical Computer Science
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Lambda calculus with explicit recursion
Information and Computation
Handbook of graph grammars and computing by graph transformation
Bisimilarity in term graph rewriting
Information and Computation - Special issue on EXPRESS 1997
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Continuous semantics and inside-out reductions
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Infinitary Lambda Calculi and Böhm Models
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
The call-by-need lambda calculus
Journal of Functional Programming
Infinitary combinatory reduction systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Rewriting term-graphs with priority
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
Skew confluence was introduced as a characterization of non-confluent term rewriting systems that had unique infinite normal forms or Böhm like trees. This notion however is not expressive enough to deal with all possible sources of non-confluence in the context of infinite terms or terms extended with letrec. We present a new notion called ω-skew confluence which constitutes a sufficient and necessary condition for uniqueness. We also present a theory that can lift uniqueness results from term rewriting systems to rewriting systems on terms with letrec. We present our results in the setting of Abstract Böhm Semantics, which is a generalization of Böhm like trees to abstract reduction systems.