| 000 | 01166camuu2200325 a 4500 | |
| 001 | 000000879032 | |
| 005 | 20040426151558 | |
| 008 | 020429s2003 enka b 001 0 eng | |
| 010 | ▼a 2002067658 | |
| 020 | ▼a 0521391156 : ▼c ￡90.00 | |
| 035 | ▼a KRIC09160476 | |
| 040 | ▼a DLC ▼c DLC ▼d 241002 ▼d 241002 ▼d 211009 | |
| 042 | ▼a pcc | |
| 049 | 1 | ▼l 121093656 ▼f 과학 |
| 050 | 0 0 | ▼a QA267 ▼b .T43 2003 |
| 082 | 0 0 | ▼a 005.13/1 ▼2 21 |
| 090 | ▼a 005.131 ▼b T316t | |
| 110 | 2 | ▼a Terese (Group) |
| 245 | 1 0 | ▼a Term rewriting systems / ▼c Terese ; [Marc Bezem, Jan Willem Klop, Roel de Vrijer, editors]. |
| 260 | ▼a Cambridge, UK ; ▼a New York : ▼b Cambridge University Press, ▼c 2003. | |
| 300 | ▼a xxii, 884 p. : ▼b ill. ; ▼c 24 cm. | |
| 490 | 1 | ▼a Cambridge tracts in theoretical computer science ; ▼v v. 55 |
| 500 | ▼a "Terese." | |
| 504 | ▼a Includes bibliographical references (p. 826-857) and index. | |
| 650 | 0 | ▼a Rewriting systems (Computer science) |
| 700 | 1 | ▼a Bezem, M. ▼q (Marc) , ▼d 1956- |
| 700 | 1 | ▼a Klop, J. W. |
| 700 | 1 | ▼a Vrijer, Roel de. |
| 830 | 0 | ▼a Cambridge tracts in theoretical computer science ; ▼v 55. |
Holdings Information
| No. | Location | Call Number | Accession No. | Availability | Due Date | Make a Reservation | Service |
|---|---|---|---|---|---|---|---|
| No. 1 | Location Science & Engineering Library/Sci-Info(Stacks2)/ | Call Number 005.131 T316t | Accession No. 121093656 (1회 대출) | Availability Available | Due Date | Make a Reservation | Service |
Contents information
Book Introduction
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.
A comprehensive 2003 introduction to term rewriting for researchers. Features exercises, solutions and applications.
Information Provided By: :
Table of 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.
Information Provided By: :