| Computation and Reasoning - A Type Theory for Computer Science Contributor(s): Zhaohui Luo (Author) |
|
 |
ISBN: 0198538359 ISBN-13: 9780198538356 Publisher: Clarendon Press OUR PRICE: $99.75 Product Type: Hardcover Published: May 1994 Annotation: This book develops a type theory, studies its properties, and explains its uses in computer science. The book focuses in particular on how the study of type theory may offer a powerful and uniform language for programming, program specification and development, and logical reasoning. The type theory developed here reflects a conceptual distinction between logical propositions and computational data types. Starting from an introduction of the basic concepts, the author explains the meaning and use of the type-theoretic language with proof-theoretic justifications, and discusses various issues in the study of type theory. The practical use of the language is illustrated by developing an approach to specification and data refinement in type theory, which supports modular development of specification, programs, and proofs. Students and researchers in computer science and logic will welcome this exciting new book. |
| Additional Information |
| BISAC Categories: - Computers | Logic Design - Computers | Programming Languages - General - Computers | Intelligence (ai) & Semantics |
| Dewey: 004 |
| LCCN: 93046644 |
| Physical Information: 0.79" H x 6.4" W x 9.52" (1.22 lbs) 240 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This book develops a type theory, studies its properties, and explains its uses in computer science. The book focuses in particular on how the study of type theory may offer a powerful and uniform language for programming, program specification and development, and logical reasoning. The type theory developed here reflects a conceptual distinction between logical propositions and computational data types. Starting from an introduction of the basic concepts, the author explains the meaning and use of the type-theoretic language with proof-theoretic justifications, and discusses various issues in the study of type theory. The practical use of the language is illustrated by developing an approach to specification and data refinement in type theory, which supports modular development of specification, programs, and proofs. Students and researchers in computer science and logic will welcome this exciting new book. |