Generalizing Substitution

DOI10.1051/ITA:2003022MaRDI QIDQ4460688zbMATH OpenOpenAlexFDO

Authors 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, http://www.numdam.org/item?id=ITA_2003__37_4_315_0/, https://eudml.org/doc/92726

zbMATH Keywords

termsguarded substitution

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2087341
• On second-order iterative monads
• Infinite trees and completely iterative theories: A coalgebraic view
• Initial algebras of terms with binding and algebraic structure
• A general final coalgebra theorem

Cites work

• scientific article; zbMATH DE number 1701358 (Why is no real title available?)
• scientific article; zbMATH DE number 3512082 (Why is no real title available?)
• scientific article; zbMATH DE number 3549200 (Why is no real title available?)
• scientific article; zbMATH DE number 1314221 (Why is no real title available?)
• scientific article; zbMATH DE number 1343506 (Why is no real title available?)
• scientific article; zbMATH DE number 2087341 (Why is no real title available?)
• Coalgebraic monads
• Coequalizers and free triples
• Dualising initial algebras
• Free iterative theories: a coalgebraic view
• Generalised coinduction
• Generalized coiteration schemata
• Infinite trees and completely iterative theories: A coalgebraic view
• On iteratable endofunctors
• On the algebraic structure of rooted trees
• Parametric corecursion
• Recursion schemes from comonads
• Substitution in non-wellfounded syntax with variable binding

Cited in

(29)

• A coinductive calculus for asynchronous side-effecting processes
• Unguarded recursion on coinductive resumptions
• Full substitutability
• Unguarded recursion on coinductive resumptions
• Substitution in non-wellfounded syntax with variable binding
• The coinductive resumption monad
• Substitution in non-wellfounded syntax with variable binding
• Complete Elgot monads and coalgebraic resumptions
• scientific article; zbMATH DE number 6740664 (Why is no real title available?)
• A coinductive calculus for asynchronous side-effecting processes
• Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
• Higher-order algebras and coalgebras from parameterized endofunctors
• Bases for parametrized iterativity
• Unifying guarded and unguarded iteration
• Representing guardedness in call-by-value and guarded parametrized monads
• Uniform Elgot iteration in foundations
• Initial algebras of terms with binding and algebraic structure
• Point-free substitution
• scientific article; zbMATH DE number 2087341 (Why is no real title available?)
• A unifying categorical view of nondeterministic iteration and tests
• The parametric continuation monad
• scientific article; zbMATH DE number 2080005 (Why is no real title available?)
• Base modules for parametrized iterativity
• Algebras with parametrized iterativity
• Term context
• Abstract substitution in enriched categories
• Monadic augment and generalised short cut fusion
• Substitution operators
• On the Notion of Substitution

This page was built for publication: Generalizing Substitution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4460688)