×

Parameter passing in nondeterministic recursive programs. (English) Zbl 0418.68011


MSC:

68N01 General topics in the theory of software
68Q60 Specification and verification (program logics, model checking, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Dijkstra, E. D., A Discipline of Programming (1976), Prentice-Hall: Prentice-Hall Englewood Cliffs, N. J · Zbl 0368.68005
[2] Elgot, C. C., Monadic computation and iterative algebraic theories, (Rose; Shperdson, Proc. Logic Colloq.. Proc. Logic Colloq., Bristol, 1973 (1975), North-Holland: North-Holland Amsterdam) · Zbl 0123.33502
[3] Elgot, C. C., Matricial theories, J. Algebra, 42, 391-422 (1976) · Zbl 0361.18004
[4] M. Hennessy; M. Hennessy · Zbl 0437.68002
[5] Hennessy, M.; Ashcroft, E. A., The semantics of nondeterminism, (Third International Colloq. on Automata, Languages and Programming. Third International Colloq. on Automata, Languages and Programming, Edinburgh (1976)) · Zbl 0379.02015
[6] Hennessy, M.; Ashcroft, E. A., Parameter-passing mechanicms and non-determinism, (Proc. 9th ACM Symp. Theory of Computing. Proc. 9th ACM Symp. Theory of Computing, Boulder (1977)), 306-311
[7] Ingerman, P. Z., Thunks, Comm. ACM, 4, 55-58 (1961) · Zbl 0098.10208
[8] Lehmann, D. J., Categories for fix point semantics, (Proc. 17th IEEE Symp. on Foundations of Computer Science. Proc. 17th IEEE Symp. on Foundations of Computer Science, Houston (1976)), 122-126
[9] Manna, Z., Mathematical Theory of Computation (1974), McGraw-Hill: McGraw-Hill New York · Zbl 0353.68066
[10] Plotkin, G. D., A powerdomain construction, SIAM J. Comput., 5, 452-487 (1976) · Zbl 0355.68015
[11] Deroever, W. P., Call-by-value versus call-by-name: A proof theoretic comparison, (Lecture Notes in Computer Science No. 28 (1975), Springer-Verlag: Springer-Verlag New York), 451-463 · Zbl 0303.68014
[12] Smyth, M. B., Power Domains, J. Comput. System Sci., 16, 23-36 (1978) · Zbl 0391.68011
[13] Vuillemin, J., Proof Techniques for Recursive Programs, (Ph. D. thesis (1973), Stanford University)
[14] Wright, J. B.; Goguen, J. A.; Thatcher, J. W.; Wagner, E. G., Rational algebraic theories and fixed-point solutions, (Proc. 17th IEEE Symp. on Foundations of Computer Science. Proc. 17th IEEE Symp. on Foundations of Computer Science, Houston (1976)), 147-158
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.