Highlights in infinitary rewriting and lambda calculus
From MaRDI portal
Publication:1929230
DOI10.1016/J.TCS.2012.08.018zbMATH Open1284.68323OpenAlexW2078043326MaRDI QIDQ1929230FDOQ1929230
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
- Infinitary lambda calculus
- Infinitary lambda calculus and discrimination of Berarducci trees.
- Full abstraction in the lazy lambda calculus
- Lambda-calculus terms that reduce to themselves
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Transfinite reductions in orthogonal term rewriting systems
- Infinitary Combinatory Reduction Systems: Confluence
- Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
- Complexity of Fractran and Productivity
- PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES
- Lazy productivity via termination
- Infinitary combinatory reduction systems
- Data-Oblivious Stream Productivity
- Term Rewriting and Applications
- Productivity of stream definitions
- Normalization of Infinite Terms
- Degrees of Undecidability in Term Rewriting
- Levels of undecidability in rewriting
- Needed reduction and spine strategies for the lambda calculus
- Transfinite reductions in orthogonal term rewriting systems
- INFINITARY REWRITING: FOUNDATIONS REVISITED
- Conditional linearization
- Non-existent Statman's double fixed point combinator does not exist, indeed
- Reduction Under Substitution
- Reinterpreting Compression in Infinitary Rewriting
- The combinator S
- On confluence and residuals in Cauchy convergent transfinite rewriting
- An Alpha-Corecursion Principle for the Infinitary Lambda Calculus
- On Normalisation of Infinitary Combinatory Reduction Systems
- Reduction Strategies and Acyclicity
- Comparing Böhm-Like Trees
- Proving Infinitary Normalization
- Meaningless Sets in Infinitary Combinatory Logic
- Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting
- Weak Convergence and Uniform Normalization in Infinitary Rewriting
- Computer Science Logic
Cited In (10)
- Transducer degrees: atoms, infima and suprema
- Clocks for Functional Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Degrees of Transducibility
- Applications of infinitary lambda calculus
- Infinitary rewriting: closure operators, equivalences and models
- On the complexity of stream equality
This page was built for publication: Highlights in infinitary rewriting and lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929230)
