Powerdomains and nondeterministic recursive definitions

A nondeterministic Language for recursive definitions, L, is defined. It includes simple functions for manipulating data values, in this case the natural numbers, a choice operator OR and recursive procedures. Various kinds of parameter-passing mechanisms are allowed: the well-known call-by-value, run-time choice which models the Algo160 substitution rule and call-time choice in which no nondeterminism is allowed in the actual parameters once the procedure has been called.

[1]  Egidio Astesiano,et al.  Nondeterminism and Fully Abstract Models , 1980, RAIRO Theor. Informatics Appl..

[2]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[3]  Michael J. C. Gordon,et al.  The Denotational Description of Programming Languages , 1979, Springer New York.

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

[5]  Egidio Astesiano,et al.  Sharing in Nondeterminism , 1979, ICALP.

[6]  Glynn Winskel,et al.  Events in computation , 1980 .

[7]  Matthew Hennessy,et al.  The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment , 1980, SIAM J. Comput..

[8]  Friedrich L. Bauer,et al.  Revised report on the algorithm language ALGOL 60 , 1963, CACM.

[9]  Martin Wirsing,et al.  Nondeterministic three-valued logic: Isotonic and guarded truth-functions , 1983 .

[10]  Gordon D. Plotkin,et al.  Dijkstras Predicate Transformers & Smyth's Power Domaine , 1979, Abstract Software Specifications.

[11]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[12]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[13]  Mark B Trakhtenbrot,et al.  Relationships Between Classes of Monotonic Functions , 1976, Theor. Comput. Sci..

[14]  Jean Vuillemin.  Correct and Optimal Implementations of Recursion in a Simple Programming Language , 1974, J. Comput. Syst. Sci..

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

[16]  Peter Naur.  Documentation problems: ALGOL 60 , 1963, CACM.

[17]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .