This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science. Series Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 236 pages, black & white illustrations. BIC Classification: UM; UYA. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 13. Weight in Grams: 430. . 2008. Illustrated. paperback. . . . . Books ship from the US and Ireland. Artikel-Nr. V9780521616102
Anzahl: Mehr als 20 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | A central problem in the design of programming systems is to provide methods for verifying that computer code performs to specification. This book presents a rigorous foundation for defining Boolean categories, in which the relationship between specification and behaviour can be explored. Boolean categories provide a rich interface between program constructs and techniques familiar from algebra, for instance matrix- or ideal-theoretic methods. The book's distinction is that the approach relies on only a single program construct (the first-order theory of categories), the others being derived mathematically from four axioms. Development of these axioms (which are obeyed by an abundance of program paradigms) yields Boolean algebras of 'predicates', loop-free constructs, and a calculus of partial and total correctness which is shown to be the standard one of Hoare, Dijkstra, Pratt, and Kozen. The book is based in part on courses taught by the author, and will appeal to graduate students and researchers in theoretical computer science. Artikel-Nr. 2239347/2
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - A central problem in the design of programming systems is to provide methods for verifying that computer code performs to specification. This book presents a rigorous foundation for defining Boolean categories, in which the relationship between specification and behaviour can be explored. Boolean categories provide a rich interface between program constructs and techniques familiar from algebra, for instance matrix- or ideal-theoretic methods. The book's distinction is that the approach relies on only a single program construct (the first-order theory of categories), the others being derived mathematically from four axioms. Development of these axioms (which are obeyed by an abundance of program paradigms) yields Boolean algebras of 'predicates', loop-free constructs, and a calculus of partial and total correctness which is shown to be the standard one of Hoare, Dijkstra, Pratt, and Kozen. The book is based in part on courses taught by the author, and will appeal to graduate students and researchers in theoretical computer science. Artikel-Nr. 9780521616102
Anzahl: 1 verfügbar