Buch, Englisch, Band 51, 410 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 817 g
Buch, Englisch, Band 51, 410 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 817 g
Reihe: Cambridge Tracts in Theoretical Computer Science
ISBN: 978-0-521-77173-3
Verlag: Cambridge University Press
Mathematics is about proofs, that is the derivation of correct statements; and calculations, that is the production of results according to well-defined sets of rules. The two notions are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. The aim of the author is to explore this relationship. The book itself forms an introduction to simple type theory. Starting from the familiar propositional calculus the author develops the central idea of an applied lambda-calculus. This is illustrated by an account of Gödel's T, a system which codifies number-theoretic function hierarchies. Each of the book's 52 sections ends with a set of exercises, some 200 in total. These are designed to help the reader get to grips with the subject, and develop a further understanding. An appendix contains complete solutions of these exercises.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Introduction; Preview; Part I. Development and Exercises: 1. Derivation systems; 2. Computation mechanisms; 3. The typed combinator calculus; 4. The typed l-calculus; 5. Substitution algorithms; 6. Applied l-calculi; 7. Multi-recursive arithmetic; 8. Ordinals and ordinal notation; 9. Higher order recursion; Part II. Solutions: A. Derivation systems; B. Computation mechanisms; C. The typed combinator calculus; D. The typed l-calculus; E. Substitution algorithms; F. Applied l-calculi; G. Multi-recursive arithmetic; H. Ordinals and ordinal notation; I. Higher order recursion; Postview; Bibliography; Commonly used symbols; Index.
