Normalization of Infinite Terms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- Infinitary normalization
- Matrix interpretations for proving termination of term rewriting
- Matrix Interpretations for Proving Termination of Term Rewriting
- On Normalisation of Infinitary Combinatory Reduction Systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Termination of term rewriting using dependency pairs
- Termination of term rewriting: Interpretation and type elimination
- Transfinite reductions in orthogonal term rewriting systems
Cited in
(14)- Finite notations for infinite terms
- Highlights in infinitary rewriting and lambda calculus
- Infinitary rewriting: closure operators, equivalences and models
- Infinitary normalization
- Modularity of Convergence in Infinitary Rewriting
- Proving Infinitary Normalization
- Degrees of Undecidability in Term Rewriting
- Strong normalization of barrecursive terms without using infinite terms
- Coinductive foundations of infinitary rewriting and infinitary equational logic
- Formalized proofs of the infinity and normal form predicates in the first-order theory of rewriting
- Standard normalization for infinite typed terms
- Levels of undecidability in rewriting
- Characterizing morphic sequences
- Should computations halt?
This page was built for publication: Normalization of Infinite Terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522036)