Mathematics of Program ConstructionSpringer-Verlag, 1998 - Computer programming |
Contents
Invited Lectures | 1 |
Contributed Lectures | 23 |
An application of program derivation techniques to 18thcentury | 44 |
Copyright | |
15 other sections not shown
Other editions - View all
Common terms and phrases
abstract action systems algorithm arity assume behavior bimap binary trees boolean C.A.R. Hoare calculus channel coinductive definitions comap component composition Computer Science construction data structure datatype defined denotes derivation dom(t Duration Calculus edges element example expression F(id finite fixpoint fold formal formula function functor graph handshaking holds imperative programming implementation induction infinite initial input interpretation interval Kleene algebra label language Lemma List logic metric space minimum spanning tree Mofun monotonic natural numbers natural transformation node object OO-action system operator output P₁rdy Pardy path polytypic predicate transformer problem procedure program transformers proof properties Proposition proved q-realizability recursion refinement refinement calculus relation repmin rule satisfies semantics sequence slack spanning tree specification step subset temporal logic Theorem theory TID,o true upwards accumulation