Skip to main content
SpringerLink
Log in

On effective computations of non-deterministic schemes

  • Conference paper
  • First Online:
International Symposium on Programming (Programming 1982)

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

Included in the following conference series:

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. ADJ-group: A junction between computer science and category theory. IBM research report RC-4526, 1973

    Google Scholar 

  2. ADJ-group: Some fundamentals of order algebraic semantics. MFCS'76, LNCS 45, 1976

    Google Scholar 

  3. Arnold, A., Nivat, M.: Metric interpretations of infinite trees and semantics of non deterministic programs. Techn. Rep. Lille 1978

    Google Scholar 

  4. Arnold, A., Nivat, M.: Formal computations of non deterministic recursive program schemes. Math. Syst. Th. 13, 1980

    Google Scholar 

  5. Beck, J.: Distributive laws. Lect. Notes Math. 80, 1969

    Google Scholar 

  6. Dubuc, E.: Kan extensions in enriched category theory. Lect. Notes Math. 145, 1970

    Google Scholar 

  7. Hennessy, M.C.B., Plotkin, G.: Full abstraction of a simple parallel programming language. MFCS'79, LNCS 74, 1979

    Google Scholar 

  8. Hennessy, M.C.B., Ashcroft, E.A.: The semantics of non-determinism. 3rd ICALP, Edinburgh 1976

    Google Scholar 

  9. Huwig, H., Poigné, A.: Continuous and non-deterministic completions of algebras. 3rd Hungarian Comp. Sci. Conf., Budapest 1981

    Google Scholar 

  10. MacLane, S.: Kategorien. Berlin-Heidelberg-New-York 1972

    Google Scholar 

  11. Manes, E.G.: Algebraic Theories. Berlin-Heidelberg-New-York 1976

    Google Scholar 

  12. Meseguer, J.: On order-complete universal algebra and enriched functorial semantics. FCT')), LNCS 56, Poznan 1977

    Google Scholar 

  13. Meseguer, J.: Order completion monads. Math. Dpt. UCLA, Berkeley, 1979

    Google Scholar 

  14. Nivat, M.: Non deterministic programs: an algebraic overview. Lab. Informatique Theorique et Programmation, Paris 1980

    Google Scholar 

  15. Poigné, A.: Using least fixed points to characterize formal computations of non-deterministic equations. Proc. Conf. Formalization of programming concepts. LNCS 107, Peniscola 1981

    Google Scholar 

  16. Poigné, A.: An order semantics for non-deterministic program schemes. 11. GI-Jahrestagung, Fachber. Informatik 50, 1981

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik II, Universität Dortmund, Postfach 500 500, D-4600, Dortmund 50

    Axel Poigné

Authors
  1. Axel Poigné
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mariangiola Dezani-Ciancaglini Ugo Montanari

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poigné, A. (1982). On effective computations of non-deterministic schemes. In: Dezani-Ciancaglini, M., Montanari, U. (eds) International Symposium on Programming. Programming 1982. Lecture Notes in Computer Science, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11494-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-11494-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11494-9

  • Online ISBN: 978-3-540-39184-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation