Introducing a calculus of trees

  • S. Kasangian
  • S. Vigna
CAAP Colloquium On Trees In Algebra And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 493)


Binary Tree Leaf Product Label Tree Forgetful Functor Follow Diagram Commute 
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.


  1. [Bén90]
    J. Bénabou. Lectures held at the Mathematics and Computer Science Departments of the University of Milano, and talk at the Category Theory '90 Conference in Como. 1990.Google Scholar
  2. [BK85]
    J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77–121, 1985.Google Scholar
  3. [DKV]
    P. Degano, S. Kasangian, and S. Vigna. Applications of the calculus of trees to process description languages. Submitted.Google Scholar
  4. [KL]
    S. Kasangian and A. Labella. Continuous time agents. To appear in Proceedings MFPS '91.Google Scholar
  5. [KL90]
    S. Kasangian and A. Labella. Enriched categorical semantics for distributed calculi. Journal of Pure and Applied Algebra, 1990. To appear.Google Scholar
  6. [Knu73]
    D.E. Knuth. The Art of Computer Programming. Addison-Wesley, 1973.Google Scholar
  7. [KV]
    S. Kansangian and S. Vigna. Trees in a distributive category. To appear in Proceedings CT '90.Google Scholar
  8. [MB67]
    S. Mac Lane and G. Birkhoff. Algebra. Macmillan, 1967.Google Scholar
  9. [Mil80]
    R. Milner. A Calculus of Communicating Systems. Number 92 in Lecture Notes in Computer Science. Springer-Verlag, 1980.Google Scholar
  10. [Win84]
    G. Winskel. Synchronization trees. Theoretical Computer Science, 34:33–82, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • S. Kasangian
    • 1
  • S. Vigna
    • 1
  1. 1.Dipartimento di MatematicaUniversità di MilanoMilano MIItaly

Personalised recommendations