Advertisement

Using least fixed points to characterize formal computations of non-deterministic equations

  • Axel Poigné
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 107)

Abstract

We extend the least fixed point techniques to the case of non-deterministic equations. Commutative idempotent semigroups in the category of ω-complete posets are used as non-deterministic domains.

Keywords

Computation Sequence Left Adjoint Forgetful Functor Denotational Semantic Strict Monotone 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    ADJ-group: A junction between computer science and category theory. IBM research report RC-4526, 1973Google Scholar
  2. [2]
    ADJ-group: Some fundamentals of order algebraic semantics. MFCS '76, Lect. Notes in Comp. Sci. 45, 1976Google Scholar
  3. [3]
    ADJ-group: Rational algebraic theories and fixed-point solutions. 17th IEEE Symp. on Found. of Comp., Houston 1976Google Scholar
  4. [4]
    ADJ-group: Programming languages as mathematical objects. MFCS '78, Lect. Notes in Comp. Sci. 64, 1978Google Scholar
  5. [5]
    A.Arnold, M.Nivat: Non deterministic recursive program schemes. FCT '77, Lect. Notes in Comp. Sci. 56, Poznan 1977Google Scholar
  6. [6]
    A.Arnold, M.Nivat: Metric interpretations of infinite trees and semantics of non deterministic programs. Techn. Rep., Lille 1978Google Scholar
  7. [7]
    A.Arnold, M.Nivat: Formal computations of non deterministic recursive program schemes. Math. Syst. Th. 13, 1980Google Scholar
  8. [8]
    J.Engelfriet, E.M.Schmidt: IO and OI, JCSS 15, 1977Google Scholar
  9. [9]
    M.C.B.Hennessy, G.Plotkin: Full abstraction of a simple programming language. MFCS '79, Lect. Notes in Comp. Sci. 74, 1979Google Scholar
  10. [10]
    H.Huwig, A.Poigné: Continuous and non-deterministic completions of algebras. 3rd Hungarian Computer Science Conf., Budapest 1981Google Scholar
  11. [11]
    S.MacLane: Kategorien. Berlin-Heidelberg-New-York 1972Google Scholar
  12. [12]
    T.S.E.Maibaum: The semantics of non-determinism. Res. rep. CS-77-30, Waterloo 1977Google Scholar
  13. [13]
    E.G.Manes: Algebraic theories. Berlin-Heidelberg-New-York 1976Google Scholar
  14. [14]
    J.Meseguer: On order-complete universal algebra and enriched functorial semantics. FCT '77, Lect. Notes in Comp. Sci. 56, Poznan 1977Google Scholar
  15. [15]
    G. Plotkin: A power domain construction. SIAM Journ. on Comp. 5, 1976Google Scholar
  16. [16]
    A.Poigné: A least fixpoint approach to systems of non-deterministic equations. 3rd works. Categorical and alg. methods in Comp. Sci., Techn. rep., Dortmund 1980Google Scholar
  17. [17]
    A.Poigné: A least fixed point semantics of non-deterministic schemes. forthcomingGoogle Scholar
  18. [18]
    M.B.Smyth: Power domains. JCSS 16, 1978Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Axel Poigné
    • 1
  1. 1.Informatik IIUniversität DortmundDortmund 50

Personalised recommendations