Derivation and computation : taking the Curry-Howard correspondence seriously
著者
書誌事項
Derivation and computation : taking the Curry-Howard correspondence seriously
(Cambridge tracts in theoretical computer science, 51)
Cambridge University Press, 2000
大学図書館所蔵 全34件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references (p. 375-376) and index
内容説明・目次
内容説明
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 Goedel'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.
目次
- 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.
「Nielsen BookData」 より