A Caltech Library Service

Refinement Calculus, Lattices and Higher Order Logic

Back, R. J. R. (1992) Refinement Calculus, Lattices and Higher Order Logic. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished)

Postscript - Submitted Version
See Usage Policy.

PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


We show how to describe refinement calculus in a lattice theoretic framework. The predicate transformer lattice is built by pointwise extensions from the truth value lattice. A simple but very powerful statement language characterizes the monotonic predicate transformer lattice. We show how to formalize the calculus in higher order logic. We also show how to express data refinement in this framework. A theorem of data refinement with stuttering is proved, to illustrate the algebraic nature of reasoning in this framework.

Item Type:Report or Paper (Technical Report)
Additional Information:© 1992 California Institute of Technology. I would like to thank Robert Barta, Ulla Binau, Marcel van de Groot, Peter Hofstee, Rustan Leino, Carroll Morgan, Jan van de Snepscheut and Joakim von Wright for very helpful discussions on the topics treated here.
Group:Computer Science Technical Reports
Other Numbering System:
Other Numbering System NameOther Numbering System ID
Computer Science Technical Reports92-22
Series Name:Computer Science Technical Reports
Record Number:CaltechCSTR:1992.cs-tr-92-22
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26761
Deposited By: Imported from CaltechCSTR
Deposited On:25 Apr 2001
Last Modified:03 Oct 2019 03:17

Repository Staff Only: item control page