Highlights in infinitary rewriting and lambda calculus
From MaRDI portal
Publication:1929230
DOI10.1016/j.tcs.2012.08.018zbMath1284.68323OpenAlexW2078043326MaRDI QIDQ1929230
Jan Willem Klop, Jörg Endrullis, Dimitri Hendriks
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.018
Related Items (7)
Degrees of Transducibility ⋮ Transducer degrees: atoms, infima and suprema ⋮ Unnamed Item ⋮ Clocks for Functional Programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the complexity of stream equality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lazy productivity via termination
- Infinitary combinatory reduction systems
- Levels of undecidability in rewriting
- Conditional linearization
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Productivity of stream definitions
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Needed reduction and spine strategies for the lambda calculus
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Lambda-calculus terms that reduce to themselves
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- Non-existent Statman's double fixed point combinator does not exist, indeed
- Infinitary lambda calculus
- The combinator S
- Infinitary lambda calculus and discrimination of Berarducci trees.
- Transfinite reductions in orthogonal term rewriting systems
- On confluence and residuals in Cauchy convergent transfinite rewriting
- An Alpha-Corecursion Principle for the Infinitary Lambda Calculus
- Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
- Infinitary Combinatory Reduction Systems: Confluence
- On Normalisation of Infinitary Combinatory Reduction Systems
- Reduction Under Substitution
- Normalization of Infinite Terms
- Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
- Reduction Strategies and Acyclicity
- Comparing Böhm-Like Trees
- Proving Infinitary Normalization
- Degrees of Undecidability in Term Rewriting
- Transfinite reductions in orthogonal term rewriting systems
- Reinterpreting Compression in Infinitary Rewriting
- Meaningless Sets in Infinitary Combinatory Logic
- Complexity of Fractran and Productivity
- Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting
- INFINITARY REWRITING: FOUNDATIONS REVISITED
- Weak Convergence and Uniform Normalization in Infinitary Rewriting
- PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES
- Computer Science Logic
- Data-Oblivious Stream Productivity
- Term Rewriting and Applications
This page was built for publication: Highlights in infinitary rewriting and lambda calculus
