Laws of programming

Laws of programming

A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of Scott's domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggested as an aid...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Communications of the ACM 1987-08, Vol.30 (8), p.672-686
Hauptverfasser: HOARE, C. A. R, HAYES, I. J, JIFENG, H. E, MORGAN, C. C, ROSCOE, A. W, SANDERS, J. W, SORENSEN, I. H, SPIVEY, J. M, SUFRIN, B. A
Format: Magazinearticle
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Software
Software engineering
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of Scott's domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggested as an aid to deriving programs from their specifications.
ISSN:0001-0782
1557-7317
DOI:10.1145/27651.27653