Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Goguen, J.A., Thatcher, J.W., Wagner, E.G. and Wright, J.B. (1977) Initial Algebra Semantics and Continuous Algebras. JACM, Vol. 24, No. 1, 68–95.
Back, R-J. (1979) On the notion of correct refinement of programs. Department of Computer Science, University of Helsinki.
Back, R-J. (1979) Proving Total Correctness of Nondeterministic Programs in Infinitary Logic. Department of Computer Science, University of Helsinki.
Berry, G. (1978) Stable Models of Typed λ-Calculi. Proc. of 5th ICALP. Lecture Notes in Computer Science, Vol. 62 (eds. G. Ausiello and C. Böhm) Berlin: Springer-Verlag.
Cohn, P.M. (1965) Universal Algebra. New York: Harper and Row.
de Bakker, J.W. (1978) Recursive Programs as Predicate Transformers. Formal Description of Programming Concepts (ed. E.J. Neuhold) Amsterdam: North Holland.
de Rover, W.P. (1976) Dijkstra's Predicate Transformer, Non-Determinism Recursion and Termination. Proc. 5th Symposium Mathematical Foundations of Computer Science (ed. A. Mazurkiewicz) pp. 472–481. Lecture Notes in Computer Science, Vol. 45. Berlin: Springer-Verlag.
Dijkstra, E.W. (1976) A Discipline of Programming. New Jersey: Prentice-Hall.
Gordon, M.J.C. (1979) The Denotational Description of Programming Languages. An Introduction. Berlin: Springer-Verlag.
Harel, D. and Pratt, V.R. (1978) Nondeterminism in Logics of Programs. Proc. of the 5th Ann. ACM Symposium on Principles of Programming Languages, Tucson, Arizona, pp. 203–213.
Hennessy, M.C.B. and Plotkin, G.D. (1979) Full Abstraction for a Simple Parallel Programming Language. Proc. of the 8th Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, No. 74 (ed. J. Becvar) pp. 108–120, Berlin: Springer-Verlag.
Huet, G. (1977) Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Proc. of the 18th IEEE Symposium on Foundations of Computer Science, pp. 30–45.
Jensen, K. (1978) Connection between Dijkstra's Predicate Transformers and Denotational Continuation Semantics. DAIMI PB-86, Dept. of Computer Science, University of Aarhus.
Keller, R.M. (1976) Formal Verification of Parallel Programs. Comm. ACM 19, 7, 371–384.
Milne, R.E. and Strachey, C. (1976) A Theory of Programming Language Semantics. New York: Wiley.
Milne, R.E. (1978) Transforming Predicate Transformers. Formal Description of Programming Concepts (ed. E.J. Neuhold) Amsterdam: North Holland.
Milner, R. (1976) Program Semantics and Mechanised Proof. Foundation of Computer Science II (eds. K.R. Apt and J.W. de Bakker) Mathematical Centre Tracts 82, Mathematisch Centrum, Amsterdam.
Plotkin, G.D. (1975) Call-by-Name, Call-by-Value and the λ-Calculus. TCS, Vol. 1, 125–159.
Plotkin, G.D. (1976) A Powerdomain Construction. SIAM Journal on Computation, Vol. 5, No. 3, 452–487.
Smyth, M. (1978) Powerdomains. JCSS, Vol. 16, No. 1.
Stoy, J.E. (1977) Denotational Semantics: the Scott-Strachey Approach to Programming Language Theory. MIT Press.
Strachey, C. and Wadsworth, C.P. (1974) Continuations. A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory.
Wadwworth, C.P. (1980) Semantic Domains for Programming Languages. Prentice-Hall. To appear.
Wand, M. (1977) A Characterisation of Weakest Preconditions. JCSS, Vol. 15, No. 2, 209–212.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Plotkin, G.D. (1980). Dijkstra's predicate transformers and smyth's powerdomains. In: Bjøorner, D. (eds) Abstract Software Specifications. Lecture Notes in Computer Science, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10007-5_48
Download citation
DOI: https://doi.org/10.1007/3-540-10007-5_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10007-2
Online ISBN: 978-3-540-38136-5
eBook Packages: Springer Book Archive