Terms and Infinite Trees as Monads Over a Signature

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.

[1]  Michael A. Arbib,et al.  A categorist's view of automata and systems , 1974, Category Theory Applied to Computation and Control.

[2]  H. Herrlich,et al.  Identities in Categories , 1972, Canadian Mathematical Bulletin.

[3]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[5]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[6]  Suad Alagic Natural State Transformations , 1975, J. Comput. Syst. Sci..

[7]  David B. Benson,et al.  Algebraic Solutions to Recursion Schemes , 1987, J. Comput. Syst. Sci..

[8]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[9]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[10]  J. W. de Bakker,et al.  Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..