Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science)

個数：

Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    【重要ご説明事項】
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版／ページ数 908 p.
  • 言語 ENG
  • 商品コード 9780521391153
  • DDC分類 005.131

Full Description

Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.

Contents

1. Abstract reduction systems; 2. First-order term rewriting systems; 3. Examples of TRSs and special rewriting formats; 4. Orthogonality; 5. Properties of rewriting: decidability and modularity; 6. Termination; 7. Completion of equational specifications; 8. Equivalence of reductions; 9. Strategies; 10. Lambda calculus; 11. Higher order rewriting; 12. Infinitary rewriting; 13. Term graph rewriting; 14. Advanced ARS theory; 15. Rewriting based languages and systems; 16. Mathematical background.