Predicate Transformer Semantics by Manes Ernest (14 results)
Language: English
Published by Cambridge Univ Pr, West Nyack, New York, U.S.A. 1992
Series: Cambridge Tracts in Theoretical Computer Science, Book 12 of 40. Book 12 of 40 - Cambridge Tracts in Theoretical Computer Science
- Hardcover
Seller: Benjamin Books, Ottawa, CanadaBenjamin Books
Contact seller5-star sellerCondition: Used - Very good
£ 11.49
£ 8.92 shippingShips from Canada to U.S.A.Quantity: 1 available
Condition: Very Good (+). hardcover.
- Softcover
Seller: California Books, Miami, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 65.85
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 60.03
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 57.18
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
Paperback. Condition: New.
- Softcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 72.20
£ 9.09 shippingShips from Ireland to U.S.A.Quantity: Over 20 available
Condition: 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. . . . .
- Softcover
Seller: Kennys Bookstore, Olney, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
£ 87.17
£ 7.81 shippingShips within U.S.A.Quantity: Over 20 available
Condition: 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.
- Softcover
Seller: Buchpark, Trebbin, GermanyBuchpark
Contact seller5-star sellerCondition: Used - Fine
£ 40.30
£ 90.93 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: 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 spe…cification 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.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 79.58
£ 53.98 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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 spe…cification 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.
- Softcover
- Print on Demand
Seller: Grand Eagle Retail, Bensenville, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
£ 65.84
Free ShippingShips within U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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. Bo…olean 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. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Softcover
- Print on Demand
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 62.32
£ 10.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 1st edition. 223 pages. 9.50x7.25x0.50 inches. In Stock. This item is printed on demand.
- Softcover
- Print on Demand
Seller: THE SAINT BOOKSTORE, Southport, United KingdomTHE SAINT BOOKSTORE
Contact seller5-star sellerCondition: New
£ 66.57
£ 15.35 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
£ 68.49
£ 37.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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. Bo…olean 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. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 68.29
£ 42.43 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science.Inhaltsverzeichnis1. Finite coproducts 2. Structure of a Bo…olean category.
- Softcover
- Print on Demand
Seller: AussieBookSeller, Truganina, AustraliaAussieBookSeller
Contact seller5-star sellerCondition: New
£ 99.49
£ 27.51 shippingShips from Australia to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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. Bo…olean 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. This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
