Abstract
In this paper, we prove that the usual construction of terms and infinite trees over a signature is a particular case of a more general construction of monads over the category of sets. In this way, we obtain a family of semantical domains having a tree-like structure and appearing as the completions of the corresponding finite structures. Though it is quite different in its technical developments our construction should be compared with the one of De Bakker and Zucker which is very similar in spirit and motivation. We feel that one outcome of the present approach is that, due to its connection with Lawvere's algebraic theories, it should provide an interesting framework to deal with equational varieties of process algebras.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Suad Alagić. Natural state transformations. JCSS, 10, 1975.
M. Arbib and E. Manes. A categorist's view of automata and systems. Lecture notes in computer science, 25, 1975.
D.B. Benson and I. Guessarian. Algebraic solutions to recursion schemes. JCSS, 35, 1987.
M. Barr and C. Wells. Toposes, triples and theories. Springer Verlag, 1985.
J.W. de Bakker and J.I. Zucker. Processes and the denotational semantics of concurrency. Information and Control, 54, 1982.
W.S. Hatcher. Quasiprimitive categories. Math. Ann., 190, 1970.
H. Herrlich and C.M. Ringel. Identities in categories. Canadian Math. Bull., 15, 1972.
F. W. Lawvere. Functorial semantics of algebraic theories. Proc. Nat. Acad. Scien. USA, 50(5), 1963.
E. G. Manes. Algebraic theories. Springer Verlag, 1976.
Robin Milner. A calculus of communicating systems. Springer Verlag Verlag LNCS, n 92, 1980.
J. Meseguer and U. Montanari. Petri nets are monoids. Comp. Sci. Lab. SRI international, 1988.
Horst Schubert. Categories. Springer Verlag, 1972.
Smyth and Plotkin. The category-theoretic solution of recursive domain equations. Siam J. Compt., 11(4), 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Badouel, E. (1989). Terms and infinite trees as monads over a signature. In: Díaz, J., Orejas, F. (eds) TAPSOFT '89. CAAP 1989. Lecture Notes in Computer Science, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50939-9_126
Download citation
DOI: https://doi.org/10.1007/3-540-50939-9_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50939-4
Online ISBN: 978-3-540-46116-6
eBook Packages: Springer Book Archive