×

zbMATH — the first resource for mathematics

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.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Dijkstra, E.D., A discipline of programming, (1976), Prentice-Hall Englewood Cliffs, N. J · Zbl 0368.68005
[2] Elgot, C.C., Monadic computation and iterative algebraic theories, () · Zbl 0123.33502
[3] Elgot, C.C., Matricial theories, J. algebra, 42, 391-422, (1976) · Zbl 0361.18004
[4] \scM. Hennessy, “The Semantics of Call-by-Value and Call-by-Name in a Nondeterministic Environment,” Tech. Report CS-77-13, Univ. of Waterloo. · Zbl 0437.68002
[5] Hennessy, M.; Ashcroft, E.A., The semantics of nondeterminism, () · Zbl 0379.02015
[6] Hennessy, M.; Ashcroft, E.A., Parameter-passing mechanicms and non-determinism, (), 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, (), 122-126
[9] Manna, Z., Mathematical theory of computation, (1974), 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, (), 451-463
[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, ()
[14] Wright, J.B.; Goguen, J.A.; Thatcher, J.W.; Wagner, E.G., Rational algebraic theories and fixed-point solutions, (), 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.