- 5 Ergebnisse
Kleinster Preis: € 85,59, größter Preis: € 111,94, Mittelwert: € 94,51
1
Term Rewriting and Applications : 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings - Christophe Jermann
Bestellen
bei hive.co.uk
£ 76,08
(ca. € 86,00)
Bestellengesponserter Link
Christophe Jermann:

Term Rewriting and Applications : 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings - neues Buch

2005, ISBN: 9783540320333

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…

No. 9783540320333. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
2
Term Rewriting and Applications : 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings - Norbert Fuhr
Bestellen
bei hive.co.uk
£ 84,15
(ca. € 95,92)
Bestellengesponserter Link

Norbert Fuhr:

Term Rewriting and Applications : 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings - neues Buch

2005, ISBN: 9783540320333

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…

No. 9783540320333. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
3
Term Rewriting and Applications - Jürgen Giesl
Bestellen
bei Springer.com
€ 93,08
Versand: € 0,001
Bestellengesponserter Link
Jürgen Giesl:
Term Rewriting and Applications - neues Buch

2005

ISBN: 9783540320333

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 … Mehr…

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
4
Term Rewriting and Applications
Bestellen
bei Springer.com
€ 85,59
Versand: € 0,001
Bestellengesponserter Link
Term Rewriting and Applications - neues Buch

2005, ISBN: 9783540320333

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-32033-3. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
5
Bestellen
bei lehmanns.de
€ 111,94
Versand: € 0,001
Bestellengesponserter Link
Jurgen Giesl:
Term Rewriting and Applications - neues Buch

2005, ISBN: 9783540320333

16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Berlin Heidelberg, 2005

Versandkosten:Download sofort lieferbar. (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

Detailangaben zum Buch - Term Rewriting and Applications


EAN (ISBN-13): 9783540320333
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2016-12-27T13:48:48+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-11-20T20:53:00+01:00 (Berlin)
ISBN/EAN: 9783540320333

ISBN - alternative Schreibweisen:
978-3-540-32033-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: jaenicke
Titel des Buches: rewriting


Daten vom Verlag:

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

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

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...