Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's ...
Read More
Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material.
Read Less
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. 340 p. Cambridge Tracts in Theoretical Computer Science . Worked examples or Exercises; 20 Line drawings, unspecified. Intended for professional and scholarly audience.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Contains: Line drawings, Unspecified. Cambridge Tracts in Theoretical Computer Science . 20 b/w illus. 110 exercises. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Contains: Line drawings, Unspecified. Cambridge Tracts in Theoretical Computer Science . 20 b/w illus. 110 exercises. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Contains: Line drawings, Unspecified. Cambridge Tracts in Theoretical Computer Science . 20 b/w illus. 110 exercises. Intended for professional and scholarly audience.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Near Fine with No dust jacket as issued. 1107004977. A nice, bright copy.; Cambridge Tracts In Theoretical Computer Science, Series Number 52; 9.0 X 6.1 X 0.9 inches; 326 pages.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Contains: Line drawings, Unspecified. Cambridge Tracts in Theoretical Computer Science . 20 b/w illus. 110 exercises. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
