Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T22:03:35.690Z Has data issue: false hasContentIssue false
  • English
  • Français

Generalizing Substitution

Published online by Cambridge University Press:  15 January 2004

Tarmo Uustalu
Tarmo Uustalu*
Affiliation:
Inst. of Cybernetics, Tallinn Technical Univ., Akadeemia tee 21, EE-12618 Tallinn, Estonia; tarmo@cs.ioc.ee. The work was largely done during the author's postdoctoral leave to Dep. de Informática, Univ. do Minho, Braga, Portugal.
Get access

Abstract

It is well known that, given an endofunctor H on a category C , the initial (A+H-)-algebras (if existing), i.e. , the algebras of (wellfounded) H-terms over different variable supplies A, give rise to a monad with substitution as the extension operation (the free monad induced by the functor H). Moss [17] and Aczel, Adámek, Milius and Velebil [12] have shown that a similar monad, which even enjoys the additional special property of having iterations for all guarded substitution rules (complete iterativeness), arises from the inverses of the final (A+H-)-coalgebras (if existing), i.e. , the algebras of non-wellfounded H-terms. We show that, upon an appropriate generalization of the notion of substitution, the same can more generally be said about the initial T'(A,-)-algebras resp. the inverses of the final T'(A,-)-coalgebras for any endobifunctor T' on any category Csuch that the functors T'(-,X) uniformly carry a monad structure.

Keywords

Algebras of termsnon-wellfounded termssubstitutioniteration of guarded substitution rulesmonadshyperfunctionsfinitely or possibly infinitely branching trees.

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 37 , Issue 4: Fixed Points in Computer Science (FICS'02) , October 2003 , pp. 315 - 336
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Aczel, P., Algebras and coalgebras, in Revised Lectures from Int. Summer School and Wksh. on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, ACMMPC 2000 (Oxford, April 2000), edited by R. Backhouse, R. Crole and J. Gibbons. Springer-Verlag, Lecture Notes in Comput. Sci. 2297 (2002) 79-88. CrossRef
Aczel, P., Adámek, J., Milius, S. and Velebil, J., Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comput. Sci. 300 (2003) 1-45 . CrossRef
Adámek, J., Milius, S. and Velebil, J., Free iterative theories: a coalgebraic view. Math. Struct. Comput. Sci. 13 (2003) 259-320. CrossRef
J. Adámek, S. Milius and J. Velebil, On rational monads and free iterative theories, in Proc. of 9th Int. Conf. on Category Theory and Computer Science, CTCS'02 (Ottawa, Aug. 2002), edited by R. Blute and P. Selinger. Elsevier, Electron. Notes Theor. Comput. Sci. 69 (2003).
Barr, M., Coequalizers and free triples. Math. Z. 116 (1970) 307-322. CrossRef
Bartels, F., Generalized coinduction. Math. Struct. Comput. Sci. 13 (2003) 321-348. CrossRef
D. Cancila, F. Honsell and M. Lenisa, Generalized coiteration schemata, in Proc. of 6th Wksh. on Coalgebraic Methods in Computer Science, CMCS'03 (Warsaw, Apr. 2003), edited by H.P. Gumm. Elsevier, Electron. Notes Theor. Comput. Sci. 82 (2003).
Elgot, C.C., Monadic computation and iterative algebraic theories, in Proc. of Logic Colloquium '73 (Bristol, July 1973), edited by H.E. Rose and J.C. Shepherdson. North-Holland, Stud. Logic Found Math. 80 (1975) 175-230. CrossRef
Elgot, C.C., Bloom, S.L. and Tindell, R., On the algebraic structure of rooted trees. J. Comput. Syst. Sci. 16 (1978) 362-399. CrossRef
Ghani, N., Lüth, C., de Marchi, F. and Power, J., Dualising initial algebras. Math. Struct. Comput. Sci. 13 (2003) 349-370. CrossRef
N. Ghani, C. Lüth and F. de Marchi, Coalgebraic monads, in Proc. of 5th Wksh. on Coalgebraic Methods in Computer Science, CMCS'02 (Grenoble, Apr. 2001), edited by L.S. Moss. Elsevier, Electron. Notes Theor. Comput. Sci. 65 (2002).
Krstic, S., Launchbury, J. and Pavlovic, D., Categories of processes enriched in final coalgebras, in Proc. of 4th Int. Conf. on Foundations of Software Science and Computation Structures, FoSSaCS'01 (Genova, Apr. 2001), edited by F. Honsell and M. Miculan. Springer-Verlag, Lecture Notes in Comput. Sci. 2030 (2001) 303-317. CrossRef
M. Lenisa, From set-theoretic coinduction to coalgebraic coinduction: some results, some problems, in Proc. of 2nd Wksh. on Coalgebraic Methods in Computer Science, CMCS'99 (Amsterdam, March 1999), edited by B. Jacobs and J. Rutten. Elsevier, Electron. Notes Theor. Comput. Sci. 19 (1999).
E.G. Manes, Algebraic theories, Graduate Texts in Mathematics 26. Springer-Verlag, New York (1976).
R. Matthes and T. Uustalu, Substitution in non-wellfounded syntax with variable binding, in Proc. of 6th Wksh. on Coalgebraic Methods in Computer Science, CMCS'03 (Warsaw, Apr. 2003), edited by H.P. Gumm. Elsevier, Electron. Notes Theor. Comput. Sci. 82 (2003).
S. Milius, On iteratable endofunctors, in Proc. of 9th Int. Conf. on Category Theory and Computer Science, CTCS'02 (Ottawa, Aug. 2002), edited by R. Blute and P. Selinger. Elsevier, Electron. Notes Theor. Comput. Science 69 (2003).
Moss, L.S., Parametric corecursion. Theor. Comput. Sci. 260 (2001) 139-163 . CrossRef
R. Paterson, Notes on monads for functional programming, unpublished draft (1995).
T. Uustalu, (Co)monads from inductive and coinductive types, in Proc. of 2001 APPIA-GULP-PRODE Joint Conf. on Declarative Programming, AGP'01 (Évora, Sept. 2001), edited by L.M. Pereira and P. Quaresma. Dep. de Informática, Univ. do Évora (2001) 47-61.
Uustalu, T. and Vene, V., Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica 10 (1999) 5-26.
T. Uustalu and V. Vene, The dual of substitution is redecoration, in Trends in Functional Programming 3, edited by K. Hammond and S. Curtis. Intellect, Bristol & Portland, OR (2002) 99-110.
Uustalu, T., Vene, V. and Pardo, A., Recursion schemes from comonads. Nordic J. Comput. 8 (2001) 366-390.