Skip to main content
SpringerLink
Log in

On algebras of computation sequences and proofs of equivalence of operational and denotational semantics

  • Contributed Papers
  • Conference paper
  • First Online:
Theoretical Computer Science

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

  • 106 Accesses

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.,Leguy,B.: Une proprieté des forets algébriques de Greibach. I.C. 46, 1980

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. Berry,G., Levy,S.J.: Minimal and optimal computations of recursive programs. JACM 26, 1979

    Google Scholar 

  7. Boudol,G.: Sémantique opérationelle et algébrique des programmes recursif non-deterministes. Thèse d'Etat, Paris 7, 1980

    Google Scholar 

  8. Courcelle,B.: Infinite trees in normal form and recursive equations having a unique solution. Mat. Syst. Th. 13, 1979

    Google Scholar 

  9. Dubuc,E.: Kan extensions in enriched category theory. LNMath. 145, 1970

    Google Scholar 

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

    Google Scholar 

  11. Guessarian,I.: Algebraic semantics. LNCS 99, 1981

    Google Scholar 

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

    Google Scholar 

  13. Huet,G.: Confluent reductions, abstract properties and applications to term-rewriting systems. 18th FOCS, 1977

    Google Scholar 

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

    Google Scholar 

  15. MacLane,S. Kategorien, Berlin-Heidelberg-New-York 1972

    Google Scholar 

  16. Manes,E.G.: Algebraic theories. Berlin-Heidelberg-New-York 1976

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  19. Nivat, M.: Non-deterministic programs: an algebraic overview. Lab. Inf. Theor. et Programmation, Paris 1980

    Google Scholar 

  20. Poigné,A.: Using least fixed points to characterize formal computations of non-deterministic equations. Formaliz. of Programming Concepts, LNCS 107, 1981

    Google Scholar 

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

    Google Scholar 

  22. Poigné,A.: On effective computations of non-deterministic schemes. 5th Int. Symp. on Programming, LNCS 137, 1982

    Google Scholar 

  23. Poigné,A.: ‘Full version of the paper', to appear as Technical Report

    Google Scholar 

  24. Smyth,M.B.: Power domains, JCSS 16, 1978

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik II, Universität Dortmund, Postfach 50 05 00, 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

Armin B. Cremers Hans-Peter Kriegel

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poigné, A. (1982). On algebras of computation sequences and proofs of equivalence of operational and denotational semantics. In: Cremers, A.B., Kriegel, HP. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036489

Download citation

  • DOI: https://doi.org/10.1007/BFb0036489

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39421-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation