Infinitary combinatory reduction systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722716 (Why is no real title available?)
- scientific article; zbMATH DE number 3961577 (Why is no real title available?)
- scientific article; zbMATH DE number 4043233 (Why is no real title available?)
- scientific article; zbMATH DE number 3709584 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3479763 (Why is no real title available?)
- scientific article; zbMATH DE number 4124993 (Why is no real title available?)
- scientific article; zbMATH DE number 1332646 (Why is no real title available?)
- scientific article; zbMATH DE number 2031016 (Why is no real title available?)
- scientific article; zbMATH DE number 1552533 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 2090071 (Why is no real title available?)
- scientific article; zbMATH DE number 937379 (Why is no real title available?)
- scientific article; zbMATH DE number 1405629 (Why is no real title available?)
- A rewriting calculus for cyclic higher-order term graphs
- Combinatory reduction systems: Introduction and survey
- Flow analysis of lazy higher-order functional programs
- Fundamental properties of infinite trees
- Higher-order families
- Higher-order narrowing with definitional trees
- Higher-order rewrite systems and their confluence
- Infinitary combinatory reduction systems: confluence
- Infinitary combinatory reduction systems: normalising reduction strategies
- Infinitary lambda calculus
- Infinitary lambda calculus and discrimination of Berarducci trees.
- Infinitary normalization
- Infinitary rewriting: meta-theory and convergence
- Infinite unfolding and transformations of nondeterministic programs
- Initial Algebra Semantics and Continuous Algebras
- Minimal and Optimal Computations of Recursive Programs
- On Confluence of Infinitary Combinatory Reduction Systems
- On modularity in infinitary term rewriting
- Paths, computations and labels in the \(\lambda\)-calculus
- Processes, Terms and Cycles: Steps on the Road to Infinity
- REDEX CAPTURING IN TERM GRAPH REWRITING
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Rewriting Techniques and Applications
- Term Rewriting and Applications
- Transfinite reductions in orthogonal term rewriting systems
Cited in
(13)- Infinitary combinatory reduction systems: normalising reduction strategies
- Reinterpreting compression in infinitary rewriting
- On Confluence of Infinitary Combinatory Reduction Systems
- scientific article; zbMATH DE number 7168147 (Why is no real title available?)
- scientific article; zbMATH DE number 32501 (Why is no real title available?)
- Wadge reducibility and infinite computations
- Comparing Böhm-Like Trees
- Highlights in infinitary rewriting and lambda calculus
- Term Rewriting and Applications
- Computing with Infinite Terms and Infinite Reductions
- scientific article; zbMATH DE number 7199590 (Why is no real title available?)
- On Normalisation of Infinitary Combinatory Reduction Systems
- Infinitary combinatory reduction systems: confluence
This page was built for publication: Infinitary combinatory reduction systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550248)
