On Normalisation of Infinitary Combinatory Reduction Systems
From MaRDI portal
Publication:3522017
DOI10.1007/978-3-540-70590-1_12zbMATH Open1145.68448OpenAlexW1869279458MaRDI QIDQ3522017FDOQ3522017
Authors: Jeroen Ketema 
Publication date: 28 August 2008
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_12
Recommendations
Cites Work
- Combinatory reduction systems: Introduction and survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinitary lambda calculus
- Transfinite reductions in orthogonal term rewriting systems
- Infinitary normalization
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Confluence of Infinitary Combinatory Reduction Systems
- Term Rewriting and Applications
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Title not available (Why is that?)
Cited In (15)
- Perpetuality and uniform normalization in orthogonal rewrite systems
- On abstract normalisation beyond neededness
- Minimal relative normalization in orthogonal expression reduction systems
- Term Rewriting and Applications
- Weak Convergence and Uniform Normalization in Infinitary Rewriting
- Normalization of Infinite Terms
- Normal forms in combinatory logic
- Infinitary combinatory reduction systems: confluence
- Infinitary combinatory reduction systems: normalising reduction strategies
- Title not available (Why is that?)
- Counterexamples in infinitary rewriting with non-fully-extended rules
- Highlights in infinitary rewriting and lambda calculus
- An abstract Böhm-normalization
- Comparing Böhm-Like Trees
- How to normalize the Jay
This page was built for publication: On Normalisation of Infinitary Combinatory Reduction Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522017)
