Needed reduction and spine strategies for the lambda calculus
Information and Computation
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Selected papers of the 16th international colloquium on Automata, languages, and programming
Transfinite reductions in orthogonal term rewriting systems (extended abstract)
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of logic in computer science (vol. 2)
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
Full abstraction in the lazy lambda calculus
Information and Computation
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Non-existent Statman's double fixed point combinator does not exist, indeed
Information and Computation
Information and Computation - Special issue on RTA-98
Syntactic Definitions of Undefined: On Defining the Undefined
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Some philosophical issues concerning theories of combinators
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
On confluence and residuals in Cauchy convergent transfinite rewriting
Information Processing Letters
On Normalisation of Infinitary Combinatory Reduction Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Normalization of Infinite Terms
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Data-Oblivious Stream Productivity
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proving Infinitary Normalization
Types for Proofs and Programs
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Complexity of Fractran and Productivity
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Productivity of stream definitions
Theoretical Computer Science
Degrees of undecidability in term rewriting
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Modular Construction of Fixed Point Combinators and Clocked Böhm Trees
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Levels of undecidability in rewriting
Information and Computation
Infinitary Combinatory Reduction Systems
Information and Computation
Decomposing the lattice of meaningless sets in the infinitary lambda calculus
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Infinitary combinatory reduction systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Order structures on böhm-like models
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Reduction strategies and acyclicity
Rewriting Computation and Proof
| Hi-index | 5.23 |
We present some highlights from the emerging theory of infinitary rewriting, both for first-order term rewriting systems and @l-calculus. In the first section we introduce the framework of infinitary rewriting for first-order rewrite systems, so without bound variables. We present a recent observation concerning the continuity of infinitary rewriting. In the second section we present an excursion to the infinitary @l-calculus. After the main definitions, we mention a recent observation about infinite looping @l-terms, that is, terms that reduce in one step to themselves. Next we describe the fundamental trichotomy in the semantics of @l-calculus: Bohm trees, Levy-Longo trees, and Berarducci trees. We conclude with a short description of a new refinement of Bohm tree semantics, called clocked semantics.