Mathematics of Program Construction: 375th Anniversary of the Groningen University. International Conference, Groningen, The Netherlands, June 26-30, 1989 Proceedings - Softcover

Inhaltsangabe

A formal approach to large SOFTWARE CONSTRUCTION.- Mathematics of program construction applied to analog neural networks.- Termination is timing.- Towards totally verified systems.- Constructing a calculus of programs.- Specifications of concurrently accessed data.- Stepwise refinement of action systems.- A lattice-theoretical basis for a specification language.- Transformational programming and forests.- Networks of communicating processes and their (De-)composition.- Towards a calculus of data refinement.- Stepwise refinement and concurrency: A small exercise.- Deriving mixed evaluation from standard evaluation for a simple functional language.- Realizability models for program construction.- Initialisation with a final value, an exercise in program transformation.- A derivation of a systolic rank order filter with constant response time.- Searching by elimination.- The projection of systolic programs.- The formal construction of a parallel triangular system solver.- Homomorphisms and promotability.- Applicative assertions.- Types and invariants in the refinement calculus.- Algorithm theories and design tactics.- A categorical approach to the theory of lists.- Rabbitcounrt :=Rabbitcount - 1.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.