Skip to main content
SpringerLink
Log in

Non deterministic recursive program schemes

  • Section A Algebraic & Constructive Theory of Machines, Computations and Languages
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

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. A.ARNOLD. Systèmes d'équations dans le magmoïde. Ensembles rationnels et algébriques d'arbres. Thèse d'Etat, Lille (1977).

    Google Scholar 

  2. A. ARNOLD et M. DAUCHET. Théorie des magmoïdes. Publication du laboratoire de Calcul, Lille (1977).

    Google Scholar 

  3. G.BOUDOL. Langages polyadiques algébriques. Théorie des schémas de programme: sémantique de l'appel par valeur. Thèse 3o cycle, Paris (1975).

    Google Scholar 

  4. B.COURCELLE and M.NIVAT. Algebraïc families of interpretations. 17th Symp. on Foundations of Computer Science (1976).

    Google Scholar 

  5. H.EGLI. A mathematical model for non-deterministic computations. Zürich (1975).

    Google Scholar 

  6. J. ENGELFRIET and E.M. SCHMIDT. 10 and 01. Daimi Report PB 47, University of Aarhus, Danemark (1975).

    Google Scholar 

  7. M.HENNESSY and E.A. ASHCROFT. The semantics of non determinism. In "Automata, Languages and Programming" 3rd Internat. Colloquium, Edinburgh (1976).

    Google Scholar 

  8. P.HITCHCOCK and D.PARK. Induction rules and termination proofs. In "Automata, Languages and Programming" 1st Internat. Colloquium, Paris (1972).

    Google Scholar 

  9. M.NIVAT. On the interpretation of Polyadic Recursive Program Schemes. Symp. Mathematica 15 (1975).

    Google Scholar 

  10. M.NIVAT. Mots infinis engendrés par une grammaire algébrique. To appear in RAIRO Informatique Théorique.

    Google Scholar 

  11. G.D.PLOTKIN. Powerdomain Constructions. SIAM J. on Comput. (1976) 452–486.

    Google Scholar 

  12. D.SCOTT. Outline of a mathematical theory of computation. Memo Oxford (1972).

    Google Scholar 

  13. J.W. THATCHER, J.A. GOGUEN, E.G. WAGNER and J.B. WRIGHT. Initial Algebra Semantics and Continuous Algebra. J. Assoc. Comput. Mach. 24 (1977) 68–95.

    Google Scholar 

  14. J.VUILLEMIN. Syntaxe, Sémantique et Axiomatique d'un Langage de Programmation Simple. Thèse d'Etat, Paris (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lille I, France

    A. Annold

  2. Université Paris VII (LA 248 Informatique Théorique et Programmation) et IRIA, France

    M. Nivat

Authors
  1. A. Annold
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Nivat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Annold, A., Nivat, M. (1977). Non deterministic recursive program schemes. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation