- 5 Ergebnisse
Kleinster Preis: € 99,47, größter Preis: € 136,67, Mittelwert: € 111,42
1
Term Rewriting and Applications - Jürgen Giesl
Bestellen
bei booklooker.de
€ 106,99
Versand: € 2,701
Bestellengesponserter Link
Jürgen Giesl:

Term Rewriting and Applications - Taschenbuch

2007, ISBN: 9783540255963

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - This volume contains the proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA2005)… Mehr…

Versandkosten:Versand nach Deutschland. (EUR 2.70) AHA-BUCH GmbH
2
Term Rewriting and Applications
Bestellen
bei Springer.com
€ 106,99
Versand: € 0,001
Bestellengesponserter Link
Term Rewriting and Applications - neues Buch

2005, ISBN: 9783540255963

This volume contains the proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA2005),whichwasheldonApril19– 21, 2005, at the Nara-Ken New Public Ha… Mehr…

Nr. 978-3-540-25596-3. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
3
Accounting for Managers: Text and Cases - Bruns, William J.
Bestellen
bei amazon.fr
€ 136,67
Versand: € 2,991
Bestellengesponserter Link
Bruns, William J.:
Accounting for Managers: Text and Cases - neues Buch

1993

ISBN: 9783540255963

South-Western, Broché, 600 Seiten, Publiziert: 1993-10-24T00:00:01Z, Produktgruppe: Livre, Hersteller-Nr.: Illustrations, 3 kg, Livres anglais et étrangers, Boutiques, Livres, Gestion fin… Mehr…

Versandkosten:En stock. Les coûts d'expédition peuvent différer des coûts réels. (EUR 2.99) premium-books-europe
4
Term Rewriting and Applications: 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings (Lecture Notes in Computer Science (3467)) [Soft Cover ] - Giesl, Jürgen
Bestellen
bei AbeBooks.fr
€ 99,47
Versand: € 5,481
Bestellengesponserter Link
Giesl, Jürgen:
Term Rewriting and Applications: 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings (Lecture Notes in Computer Science (3467)) [Soft Cover ] - Taschenbuch

2008, ISBN: 3540255966

[EAN: 9783540255963], Nouveau livre, [SC: 5.48], [PU: Springer], Books

NEW BOOK. Versandkosten: EUR 5.48 booksXpress, Freehold, NJ, U.S.A. [71410708] [Note: 4 (sur 5)]
5
Term Rewriting and Applications - Jürgen Giesl
Bestellen
bei lehmanns.de
€ 106,99
Versand: € 0,001
Bestellengesponserter Link
Jürgen Giesl:
Term Rewriting and Applications - Erstausgabe

2005, ISBN: 9783540255963

Taschenbuch

16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2005

Versandkosten:Versand in 10-14 Tagen. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Term Rewriting and Applications

This book constitutes the refereed proceedings of the 16th International Conference on Rewriting Techniques and Applications, RTA 2005, held in Nara, Japan in April 2005.The 29 revised full papers and 2 systems description papers presented together with 5 invited articles were carefully reviewed and selected from 79 submissions. All current issues in Rewriting are addressed, ranging from foundational and methodological issues to applications in various contexts; due to the fact that the first RTA conference was held 20 years ago, the conference offered 3 invited historical papers 2 of which are included in this proceedings.

Detailangaben zum Buch - Term Rewriting and Applications


EAN (ISBN-13): 9783540255963
ISBN (ISBN-10): 3540255966
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin
536 Seiten
Gewicht: 0,801 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-03-20T18:00:30+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-11-20T20:53:00+01:00 (Berlin)
ISBN/EAN: 3540255966

ISBN - alternative Schreibweisen:
3-540-25596-6, 978-3-540-25596-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: giesl, jürgen bordeaux
Titel des Buches: japan computer, theoretical computer science, term rewriting applications, this japan, nara, rewriting lecture notes computer


Daten vom Verlag:

Autor/in: Jürgen Giesl
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Term Rewriting and Applications - 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings
Verlag: Springer; Springer Berlin
517 Seiten
Erscheinungsjahr: 2005-04-07
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XIII, 517 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Informatik; automata; automated deduction; higher order rewriting; lambda calculus; logic programming; programming calculi; proving; rewriting; rewriting systems; semantics; term rewriting; termination; type inference; unification; verification; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Artificial Intelligence; Symbolic and Algebraic Manipulation; Compiler und Übersetzer; Künstliche Intelligenz; Mathematik für Informatiker; EA

Confluent Term Rewriting Systems.- Generalized Innermost Rewriting.- Orderings for Innermost Termination.- Leanest Quasi-orderings.- Abstract Modularity.- Union of Equational Theories: An Algebraic Approach.- Equivariant Unification.- Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories.- Unification in a Class of Permutative Theories.- Dependency Pairs for Simply Typed Term Rewriting.- Universal Algebra for Termination of Higher-Order Rewriting.- Quasi-interpretations and Small Space Bounds.- A Sufficient Completeness Reasoning Tool for Partial Specifications.- Tyrolean Termination Tool.- Call-by-Value Is Dual to Call-by-Name – Reloaded.- ??-Calculus and Duality: Call-by-Name and Call-by-Value.- Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics.- Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete.- Localized Fairness: A Rewriting Semantics.- Partial Inversion of Constructor Term Rewriting Systems.- Natural Narrowing for General Term Rewriting Systems.- The Finite Variant Property: How to Get Rid of Some Algebraic Properties.- Intruder Deduction for AC-Like Equational Theories with Homomorphisms.- Proving Positive Almost-Sure Termination.- Termination of Single-Threaded One-Rule Semi-Thue Systems.- On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems.- Twenty Years Later.- Open. Closed. Open..- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code.- Extending the Explicit Substitution Paradigm.- Arithmetic as a Theory Modulo.- Infinitary Combinatory Reduction Systems.- Proof-Producing Congruence Closure.- The Algebra of Equality Proofs.- On Computing Reachability Sets of Process Rewrite Systems.- Automata andLogics for Unranked and Unordered Trees.
Includes supplementary material: sn.pub/extras

< zum Archiv...