Equational μ-calculus

  • Damian Niwiński
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)


Basic Operation Function Symbol Complete Lattice Deductive System Regular Language 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A&N]
    A. Arnold and M. Nivat, Non deterministic recursive programs, in "Fundamentals of Computation Theory", pp. 12–21, Lecture Notes in Computer Science No. 56, Springer Verlag, Heidelberg, 1977.Google Scholar
  2. [Ah&U]
    A. Aho and J.D. Ullman, "Universality of Data Retrieval Languages" 6th Symp. on Principles of Programming Languages, pp. 110–117, 1979.Google Scholar
  3. [B]
    S.L. Bloom, Varieties of ordered algebras, J, Comput. System Sci. 13, pp. 200–212, 1976.Google Scholar
  4. [C&E]
    E.C. Clarke and E.A. Emerson, Characterizing Correctness Properties of Parallel Programs Using Fixpoints, in Proc. Colloq. on Automata, Languages and Programming, pp. 169–181, 1980.Google Scholar
  5. [Ei]
    S. Eilenberg, "Automata, Languages and Machines", Vol. A, Academic Press, New York, 1974.Google Scholar
  6. [G]
    G. Gratzer, "Universal algebra", Van Nostrand Co. 1968.Google Scholar
  7. [K]
    D. Kozen, Results on the propositional μ-calculus, in "Ninth Internat. Colloq. Automata, Lang. Programming", pp. 348–359, 1982.Google Scholar
  8. [Ni a]
    D. Niwiński, Fixed-Point Characterization of Context-Free ∞-Languages, Inform. Contr., Vol. 61, No. 3, pp. 247–276, 1984.Google Scholar
  9. [Ni b]
    D. Niwiński, Fixed-point definability in monadic Kleene algebras, manuscript, 1984.Google Scholar
  10. [Pa]
    D. Park, On the semantics of fair parallelism, in "Abstract Software Specifications", Lecture Notes in Computer Science No. 86, pp. 504–526, Springer Verlag, Berlin 1980.Google Scholar
  11. [Pr a]
    V.R. Pratt, Dynamic algebras; examples, constructions, applications, MIT/LCS/TM-138, Laboratory for Comp. Sci., 1979.Google Scholar
  12. [Pr b]
    V.R. Pratt, A decidable μ-calculus (Preliminary Report), Proc. 22nd IEEE Symp. on Foundations of Computer Science, pp. 421–427, 1981.Google Scholar
  13. [T]
    J. Tiuryn, Fixed points and algebras with infinitely long expressions, Parts I, II. Fundamenta Informaticae 2, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Damian Niwiński
    • 1
  1. 1.Institute of MathematicsUniversity of WarsawWarszawa, PKiNPoland

Personalised recommendations