Skip to main content
SpringerLink
Log in

Algebraically closed theories

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1989 (MFCS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 379))

Abstract

The present work takes place in the study of infinitary behaviours for CCS-like communicating processes. A problem in that area arises from the fact that most of the abstraction morphisms we are interested in don't commute with least fixed points. In order to offer an alternative to least fixed point semantics we present an axiomatization of the notion of fixed point calculus within the formalism of algebraic theories. Such a calculus fixes one solution for each equation resulting from the interpretation of a set of recursive definitions in a way consistent with the free interpretation of the equations. This leads us to the notion of algebraically closed theory which stands for an algebraic theory equipped with a fixed point calculus. The rational theories by ADJ appear to be a special case of algebraically closed theories when least solutions are always chosen.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.W. Thatcher, E.G. Wagner and J.B. Wright. Rational algebraic theories and fixed-point solutions. Proceeding 17th IEEE Symposium on foundations of computing, 1976.

    Google Scholar 

  2. Eric Badouel. Algebraically closed theories. full version of the paper, to appear in INRIA report, 1989.

    Google Scholar 

  3. B. Courcelle, G. Kahn and J. Vuillemin. Algorithmes d'équivalence et de réduction à des expressions minimales dans une classe d'équations récursives simples. Proc. 2nd ICALP, LNCS 14, 1974.

    Google Scholar 

  4. Ph. Darondeau and B. Gamatié. Modelling infinitary behaviours of communicating systems. INRIA report n 749, 1987.

    Google Scholar 

  5. Calvin C. Elgot. Monadic computation and iterative algebraic theories. in Proceeding of logic colloquium Bristol, 1973 pp 175–230. North-Holland, Amsterdam, 1975.

    Google Scholar 

  6. Michel Eytan. La sémantique algébrique ADJ est une sémantique fonctorielle. Séminaire du LITP, janvier, 1984.

    Google Scholar 

  7. F. W. Lawvere. Functorial semantics of algebraic theories. Proc. Nat. Acad. Scien. USA, 50(5), 1963.

    Google Scholar 

  8. Robin Milner. A calculus of communicating systems. Springer Verlag LNCS, n 92, 1980.

    Google Scholar 

  9. M. Makkai and G.E. Reyes. First order categorical logic. Lecture notes in mathematics vol 611, Springer-Berlin, 1977.

    Google Scholar 

  10. Jerzy Tiuryn. Fixed points and algebras with infinitely long expressions part I. regular algebras in Proceedings MFCS 1977. Lecture note in computer science, 53, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Irisa, Campus de Beaulieu, 35042, Rennes Cedex, France

    Eric Badouel

Authors
  1. Eric Badouel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Badouel, E. (1989). Algebraically closed theories. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-51486-4_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51486-2

  • Online ISBN: 978-3-540-48176-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation