On Normalisation of Infinitary Combinatory Reduction Systems
From MaRDI portal
Publication:3522017
Recommendations
Cites work
- scientific article; zbMATH DE number 3709584 (Why is no real title available?)
- scientific article; zbMATH DE number 1332646 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 1088031 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- Combinatory reduction systems: Introduction and survey
- Infinitary lambda calculus
- Infinitary normalization
- On Confluence of Infinitary Combinatory Reduction Systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Term Rewriting and Applications
- Transfinite reductions in orthogonal term rewriting systems
Cited in
(15)- Infinitary combinatory reduction systems: normalising reduction strategies
- Normalization of Infinite Terms
- How to normalize the Jay
- Comparing Böhm-Like Trees
- An abstract Böhm-normalization
- Normal forms in combinatory logic
- Highlights in infinitary rewriting and lambda calculus
- Perpetuality and uniform normalization in orthogonal rewrite systems
- On abstract normalisation beyond neededness
- scientific article; zbMATH DE number 598799 (Why is no real title available?)
- Term Rewriting and Applications
- Counterexamples in infinitary rewriting with non-fully-extended rules
- Minimal relative normalization in orthogonal expression reduction systems
- Weak Convergence and Uniform Normalization in Infinitary Rewriting
- Infinitary combinatory reduction systems: confluence
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)
