Non Deterministic Recursive Program Schemes

A number of recent papers [4,13,14] have demonstrated the interest of attaching to the recursive program scheme S : ~i(Xl,..,Xni) = t i ; i=l,...~N the infinite tree which it computes when freely interpreted in the complete free ordered magma M~(F,V). Indeed the computed function, for any interpretation I, is a morphic image of this infinite tree, T(S,%l(Xl,...,xnl)~ The well known equivalence between operational and denotational semantics comes from the fact that T(S,%,(Xl,...,xnl)) is both

[1]  Herbert Egli.  A mathematical model for non-deterministic computations , 1975 .

[2]  Max Dauchet,et al.  Théorie des Magmoïdes (II) , 1979, RAIRO Theor. Informatics Appl..

[3]  J. Engelfriet,et al.  IO and OI , 1975 .

[4]  Matthew Hennessy,et al.  The Semantics of Nondeterminism , 1976, ICALP.

[5]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[6]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[7]  Jean Vuillemin.  Syntaxe, sémantique et axiomatique d'un langage de programmation simple , 1975 .

[8]  Maurice Nivat,et al.  Mots Infinis Engendrés par Une Grammaire Algébrique , 1977, RAIRO Theor. Informatics Appl..

[9]  Bruno Courcelle,et al.  Algebraic families of interpretations , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[10]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.