On Normalisation of Infinitary Combinatory Reduction Systems
From MaRDI portal
Publication:3522017
DOI10.1007/978-3-540-70590-1_12zbMath1145.68448OpenAlexW1869279458MaRDI QIDQ3522017
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
Related Items
Highlights in infinitary rewriting and lambda calculus, Counterexamples in infinitary rewriting with non-fully-extended rules, Normalization of Infinite Terms, Comparing Böhm-Like Trees
Cites Work
- Combinatory reduction systems: Introduction and survey
- Infinitary lambda calculus
- Transfinite reductions in orthogonal term rewriting systems
- On Confluence of Infinitary Combinatory Reduction Systems
- Term Rewriting and Applications
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item