Abstract
In their Unifying Theories of Programming (UTP), Hoare & He use the alphabetised relational calculus to give denotational semantics to a wide variety of constructs taken from different programming paradigms. A key concept in their programme is the design: the familiar precondition-postcondition pair that describes the contract between a programmer and a client. We give a tutorial introduction to the theory of alphabetised relations, and its sub-theory of designs.We illustrate the ideas by applying them to theories of imperative programming, including Hoare logic, weakest preconditions, and the refinement calculus. © Springer-Verlag 2004.
Cite
CITATION STYLE
Woodcock, J., & Cavalcanti, A. (2004). A tutorial introduction to designs in unifying theories of programming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2999, 40–66. https://doi.org/10.1007/978-3-540-24756-2_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
