Artículos relacionados a Term Rewriting Systems Hardback: 55 (Cambridge Tracts...
Term Rewriting Systems Hardback: 55 (Cambridge Tracts in Theoretical Computer Science, Series Number 55) - Tapa dura
Sinopsis
A comprehensive 2003 introduction to term rewriting for researchers. Features exercises, solutions and applications.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialCambridge University Press
- Año de publicación2003
- ISBN 10 0521391156
- ISBN 13 9780521391153
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de páginas908
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 262,29
EUR 10,43 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Term Rewriting Systems Hardback: 55 (Cambridge Tracts...
Imagen de archivo
Term Rewriting Systems
Publicado por
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 908 Illus. Nº de ref. del artículo: 7394141
Cantidad disponible: 3 disponibles
Imagen de archivo
Term Rewriting Systems (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: AussieBookSeller, Truganina, VIC, Australia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears 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. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Nº de ref. del artículo: 9780521391153
Cantidad disponible: 1 disponibles
Imagen de archivo
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Publicado por
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780521391153_new
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Publicado por
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9780521391153
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Term Rewriting Systems
Publicado por
Cambridge University Press, 2011
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A comprehensive 2003 treatment of term rewriting systems from an elementary to an advanced level. Much of this material appeared here for the first time in book form. Ideal for teaching or research, it features numerous exercises with selected solutions on . Nº de ref. del artículo: 446933901
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Term Rewriting Systems
Impresión bajo demandaLibrería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Brand New. 680 pages. 9.50x6.25x1.75 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __0521391156
Cantidad disponible: 1 disponibles
Imagen de archivo
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Publicado por
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190001411
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Term Rewriting Systems (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: CitiRetail, Stevenage, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears 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. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9780521391153
Cantidad disponible: 1 disponibles
Imagen de archivo
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Publicado por
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9780521391153
Cantidad disponible: 2 disponibles
Imagen de archivo
Term Rewriting Systems (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Nuevo
Tapa dura
Librería: Grand Eagle Retail, Fairfield, OH, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears 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. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9780521391153
Cantidad disponible: 1 disponibles