Mathematics of Program Construction
Editat de Richard S. Bird, C. Carroll Morgan, James C. P. Woodcocken Limba Engleză Paperback – 6 apr 1993
Preț: 326.88 lei
Preț vechi: 408.60 lei
-20%
Puncte Express: 490
Preț estimativ în valută:
57.80€ • 66.28$ • 49.96£
57.80€ • 66.28$ • 49.96£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540566250
ISBN-10: 3540566252
Pagini: 392
Ilustrații: VIII, 380 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540566252
Pagini: 392
Ilustrații: VIII, 380 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Extended calculus of constructions as a specification language.- On the economy of doing Mathematics.- Pretty-printing: An exercise in functional programming.- True concurrency: Theory and practice.- Programming for behaviour.- Calculating a path algorithm.- Solving optimisation problems with catamorphisms.- A time-interval calculus.- Conservative fixpoint functions on a graph.- An algebraic construction of predicate transformers.- Upwards and downwards accumulations on trees.- Distributing a class of sequential programs.- (Relational) programming laws in the boom hierarchy of types.- A logarithmic implementation of flexible arrays.- Designing arithmetic circuits by refinement in Ruby.- An operational semantics for the guarded command language.- Shorter paths to graph algorithms.- Logical specifications for functional programs.- Inorder traversal of a binary heap and its inversion in optimal time and space.- A calculus for predicative programming.- Derivation of a parallel matching algorithm.- Modular reasoning in an object-oriented refinement calculus.- An alternative derivation of a binary heap construction function.- A derivation of Huffman's algorithm.