Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Proc. of the European symposium on programming on ESOP 86
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
Program specification and verification in VDM
Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming from specifications
Programming from specifications
Beauty is our business
Data refinement of predicate transformers
Theoretical Computer Science
A practical theory of programming
A practical theory of programming
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
| Hi-index | 0.00 |
The purpose of this paper is to present some set-theoretic models of computation. This topic and its usefulness are clearly related to those presented in the book by Hoare and He: "Unifying Theories of Programming" [12]. However, we prefer to use here the term "computation" to that of "programming" as our purpose is not so much to unify various ways of programming (using different programming languages) but rather to see how various mechanical computation paradigms (be they sequential, distributed, parallel, and so on) can be given a unified mathematical theory. Our purpose is also to study how these computations can be specified and then developed by means of refinements and proofs.