Infinitary combinatory reduction systems
From MaRDI portal
Publication:550248
DOI10.1016/j.ic.2011.01.007zbMath1235.68095OpenAlexW1994588735MaRDI QIDQ550248
Jeroen Ketema, Jakob Grue Simonsen
Publication date: 8 July 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.01.007
Related Items (3)
Cites Work
- Paths, computations and labels in the \(\lambda\)-calculus
- Flow analysis of lazy higher-order functional programs
- Infinitary rewriting: meta-theory and convergence
- Fundamental properties of infinite trees
- Higher-order rewrite systems and their confluence
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Combinatory reduction systems: Introduction and survey
- Infinitary lambda calculus
- Infinitary lambda calculus and discrimination of Berarducci trees.
- Transfinite reductions in orthogonal term rewriting systems
- On modularity in infinitary term rewriting
- REDEX CAPTURING IN TERM GRAPH REWRITING
- Infinitary Combinatory Reduction Systems: Confluence
- Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
- Initial Algebra Semantics and Continuous Algebras
- Minimal and Optimal Computations of Recursive Programs
- Higher-order narrowing with definitional trees
- Higher-order families
- On Confluence of Infinitary Combinatory Reduction Systems
- Term Rewriting and Applications
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Rewriting Techniques and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Infinitary combinatory reduction systems
