Convergence in infinitary term graph rewriting systems is simple
From MaRDI portal
Publication:4585010
Recommendations
Cites work
- scientific article; zbMATH DE number 3112450 (Why is no real title available?)
- scientific article; zbMATH DE number 3709584 (Why is no real title available?)
- scientific article; zbMATH DE number 108369 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- Concrete domains
- Initial Algebra Semantics and Continuous Algebras
- Lambda calculus with explicit recursion
- Modes of convergence for term graph rewriting
- Partial Order Infinitary Term Rewriting
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Skew confluence and the lambda calculus with letrec
- Terminal coalgebras in well-founded set theory
- Transfinite reductions in orthogonal term rewriting systems
Cited in
(4)
This page was built for publication: Convergence in infinitary term graph rewriting systems is simple
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4585010)