Theories of programming: Top-Down and Bottomup and Neeting in the Middle
A theory of programming provides a scientific basis for programming practices that lead to predictable delivery of programs of high quality. A topdown theory starts with a specification of the intended behaviour of a program; and a bottomup theory starts with a description of how the program is executed. The aim of both theories is to prove theorems (often algebraic laws) that will be helpful in the design, development, compilation, testing, optimisation and maintainance of all kinds of program. The most mature theories are those that are presented both in bottomup and top-down fashion, where essentially the same laws are valid in both presentations.
KeywordsProgramming Language Operational Semantic Healthiness Condition Sequential Composition Process Algebra
Unable to display preview. Download preview PDF.
- S. Abramsky, R. Jagadeesan and P. Malacaria. Full abstraction for PCF.To appear in Information and Computation.Google Scholar
- Baeten and Weijland. Process Algebra. CUP 1990, ISBN 0521-40043-0.Google Scholar
- E.W. Dijkstra. A Discipline of Programming. Prentice Hall 1976, ISBN 013-215871-X.Google Scholar
- C.A.R. Hoare and He Jifeng. Unifying Theories of Programming. Prentice Hall International 1998, ISBN 0-13-458761-8, available from amazon.co.uk.Google Scholar
- J.M.E. Hyland and C.H.L. Ong. On Full Abstraction for PCF: I, II and III.To appear in Informatics and Computation.Google Scholar
- A.W. Roscoe. Theory and Practice of Concurrency. Prentice Hall 1998, ISBN 013-674409-5.Google Scholar