Mathematics of Program Construction
Editat de Jan L.A. van de Snepscheuten Limba Engleză Paperback – 7 iun 1989
Preț: 329.14 lei
Preț vechi: 411.42 lei
-20%
Puncte Express: 494
Preț estimativ în valută:
58.20€ • 66.76$ • 50.32£
58.20€ • 66.76$ • 50.32£
Carte tipărită la comandă
Livrare economică 29 aprilie-13 mai
Specificații
ISBN-13: 9783540513056
ISBN-10: 3540513051
Pagini: 436
Ilustrații: XII, 428 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540513051
Pagini: 436
Ilustrații: XII, 428 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.