Skip to main content
SpringerLink
Log in

Une semantique pour les arbres non deterministes

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP '81 (CAAP 1981)

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

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.

Références

  1. ADJ: "Initial algebra semantics and continuous algebras", JACM 24 (1977) 68–95

    Google Scholar 

  2. A. Arnold & M. Nivat: "Formal computations of non-deterministic recursive schemes", MST 13 (1980) 219–236

    Google Scholar 

  3. A. Arnold &M. Nivat: "Algebraic semantics of non-deterministic recursive program schemes", Rapport du LITP no 78–4, Univ. Paris 7 (1978)

    Google Scholar 

  4. J.W. de Bakker: "Semantics and termination of non-deterministic recursive programs", Proc. of the 3rd ICALP, Edimburgh (1976) 435–477

    Google Scholar 

  5. G. Boudol: "Sémantique opérationnelle et algébrique des programmes récursifs non-déterministes", Thèse, Univ. Paris 7 (1980)

    Google Scholar 

  6. G. Boudol: "On the semantics of non-deterministic recursive programs", à paraître

    Google Scholar 

  7. G. Boudol: "Category-theoretic models of non-determinism", à paraître

    Google Scholar 

  8. J.-M. Cadiou: "Recursive definitions of partial functions and their computations", Ph. D. Thesis, Stanford (1972)

    Google Scholar 

  9. B. Courcelle & M. Nivat: "Algebraic families of interpretations", 17th FOCS (1976) 137–146

    Google Scholar 

  10. G. Cousineau: "An algebraic definition for control structures", TCS 12 (1980) 175–192

    Google Scholar 

  11. E.W. Dijkstra: "Guarded commands, non-determinacy and formal derivation of programs", CACM 18 (1975) 453–457

    Google Scholar 

  12. R.W. Floyd: "Non-deterministic algorithms", JACM 14 (1967) 636–644

    Google Scholar 

  13. M. Hennessy & E.A. Aschroft: "A mathematical semantics for non-deterministic typed λ-calculus", TCS 11 (1980) 227–246

    Google Scholar 

  14. D.J. Lehmann: "Categories for fix point semantics", 17th FOCS (1976) 122–126

    Google Scholar 

  15. J. Mc Carthy: "A basis for a mathematical theory of computation", in "Computer programming and formal systems" (Braffort & Hirschberg, Eds) (1963) 33–70

    Google Scholar 

  16. Z. Manna: "The correctness of non-deterministic programs", Artificial Intelligence 1 (1970) 1–26

    Google Scholar 

  17. M. Nivat: "On the interpretation of recursive polyadic program schemes", Symposia Mathematica 15, Bologna (1975) 225–281

    Google Scholar 

  18. M. Nivat: "Non-deterministic programs: an algebraic overview", IFIP Congress 1980

    Google Scholar 

  19. M. Nivat: "Chartes, arbres, programmes itératifs", Rapport du LITP no 78–28, Univ. Paris 7 (1978)

    Google Scholar 

  20. G. Plotkin: "A power-domain construction", SIAM J. on Computing 5 (1976) 452–487

    Google Scholar 

  21. B.K. Rosen: "Program equivalence and context-free grammars", 13th SWAT (1972) 7–18

    Google Scholar 

  22. D. Scott: "Outline of a mathematical theory of computation", Technical Monograph PRG 2, Oxford (1970)

    Google Scholar 

  23. D. Scott: "The lattice of flow-diagrams", Symp. on Semantics of Algorithmic Languages, Lecture Notes in Mathematics no 182 (1971) 311–366

    Google Scholar 

  24. M. Smyth: "Power-domains", JCSS 16 (1978) 23–36

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris 7 —LITP, France

    G. Boudol

Authors
  1. G. Boudol
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egidio Astesiano Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudol, G. (1981). Une semantique pour les arbres non deterministes. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-10828-9_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10828-3

  • Online ISBN: 978-3-540-38716-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation