An Order Semantics for Non-Deterministic Recursive Program Schemes

  • Axel Poigné
Chapter
Part of the Informatik-Fachberichte book series (INFORMATIK, volume 50)

Zusammenfassung

Non-deterministic recursive program schemes are investigated by Arnold and Nivat in several papers [5],[6],[7]. They prove the coincidence of operational and denotational semantics using greatest fixpoints and metric interpretations. The objective of this paper is to demonstrate that this result may be achieved using the standard least fixpoint approach.

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

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, LNCS 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, LNCS 64 1978Google Scholar
  5. [5]
    Arnold, A., Nivat, M.: Non deterministic recursive program schemes. FCT ’77, LNCS 56, Poznan 1977Google Scholar
  6. [6]
    Arnold, A., Nivat, M.: Metric interpretations of infinite trees and semantics of non deterministic programs. Techn. Rep., Lille 1978Google Scholar
  7. [7]
    Arnold, A., Nivat, M.: Formal computations of non deterministic recursive program schemes. Math. Syst. Th. 13, 1980Google Scholar
  8. [8]
    Engelfriet, J., Schmidt, E.M.: IO and OI, JCCS 15, 1977Google Scholar
  9. [9]
    Hennessy, M.C.B.,Ashcroft, E.A.: The semantics of non-determinism. 3rd ICALP, Edinburgh 1976Google Scholar
  10. [10]
    Hennessy, M.C.B., Plotkin, G.: Full abstraction of a simple programming language. MFCS ’79, LNCS 74, 1979Google Scholar
  11. [11]
    MacLane, S.: Kategorien.Berlin-Heidelberg-New-York, 1972Google Scholar
  12. [12]
    Maibaum, T.S.E.: The semantics of non-determinism. Res. rep. CS-77–30, Waterloo 1977Google Scholar
  13. [13]
    Manes, E.G.: Algebraic theories. Berlin-Heidelberg-New-York 1976MATHCrossRefGoogle Scholar
  14. [14]
    Meseguer, J.:On order-complete universal algebra and enriched functorial semantics. FCT ’77, LNCS 56, Poznan 1977Google Scholar
  15. [15]
    Meseguer, J.: Ideal monads and Z-posets. to be publishedGoogle Scholar
  16. [16]
    Poigné A.: Using least fixed points to characterize formal computations of non-deterministic equations. Proc. Conf. Formal. of Progr. Conc.,LNCS 107, Peniscola 1981Google Scholar
  17. [17]
    Smyth, M.B.: 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 50Deutschland

Personalised recommendations