Generalizing Substitution

DOI10.1051/ita:2003022zbMath1042.18003OpenAlexW4253767731MaRDI QIDQ4460688

Tarmo Uustalu

Publication date: 29 March 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_4_315_0

zbMATH Keywords

termsguarded substitution

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Categorical semantics of formal languages (18C50) Free algebras (08B20) Categories of machines, automata (18B20)

Related Items (16)

The coinductive resumption monad ⋮ Higher-order Algebras and Coalgebras from Parameterized Endofunctors ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ Monadic augment and generalised short cut fusion ⋮ Base modules for parametrized iterativity ⋮ Unguarded recursion on coinductive resumptions ⋮ Unnamed Item ⋮ Unifying Guarded and Unguarded Iteration ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ Algebras with parametrized iterativity ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ Substitution in non-wellfounded syntax with variable binding ⋮ Bases for parametrized iterativity ⋮ Unnamed Item ⋮ A Coinductive Calculus for Asynchronous Side-Effecting Processes ⋮ The parametric continuation monad

Cites Work

• Substitution in non-wellfounded syntax with variable binding
• On the algebraic structure of rooted trees
• Infinite trees and completely iterative theories: A coalgebraic view
• Coequalizers and free triples
• Coalgebraic Monads
• On Iteratable Endofunctors
• Free iterative theories: a coalgebraic view
• Generalised coinduction
• Dualising initial algebras
• Parametric corecursion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalizing Substitution