- 5 Résultats
prix le plus bas: € 74,96, prix le plus élevé: € 119,00, prix moyen: € 86,11
1
Term Rewriting and Applications - >100
Commander
sur ebooks.com
€ 119,00
Commander
Détails et expédition
Lien sponsorisé
>100:

Term Rewriting and Applications - nouveau livre

2006, ISBN: 9783540368359

This book constitutes the refereed proceedings of the 17th International Conference on Rewriting Techniques and Applications, RTA 2006, held in Seattle, WA, USA in August 2006. The book p… Plus…

new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise
fermer(X)
2
Term Rewriting and Applications - Frank Pfenning
Commander
sur Springer.com
€ 74,96
Commander
Détails et expédition
Lien sponsorisé

Frank Pfenning:

Term Rewriting and Applications - nouveau livre

ISBN: 9783540368359

Computer Science; Programming Languages, Compilers, Interpreters; Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Artificial Intelligence (incl. Robotics); Symbo… Plus…

  - Frais d'envoizzgl. Versandkosten, Livraison non-comprise
fermer(X)
3
Term Rewriting and Applications - Frank Pfenning
Commander
sur Springer.com
€ 74,96
Commander
Détails et expédition
Lien sponsorisé
Frank Pfenning:
Term Rewriting and Applications - nouveau livre

ISBN: 9783540368359

Computer Science; Programming Languages, Compilers, Interpreters; Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Artificial Intelligence (incl. Robotics); Symbo… Plus…

  - Frais d'envoizzgl. Versandkosten., Livraison non-comprise
fermer(X)
4
Term Rewriting and Applications : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings - T.I. Atta-Ur-Rahman
Commander
sur hive.co.uk
£ 68,85
(environ € 80,12)
Commander
Détails et expédition
Lien sponsorisé
T.I. Atta-Ur-Rahman:
Term Rewriting and Applications : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings - nouveau livre

2006, ISBN: 9783540368359

; PDF; Computing > Computer programming / software development > Programming & scripting languages: general, Springer Berlin Heidelberg

No. 9783540368359. Frais d'envoiInstock, Despatched same working day before 3pm, zzgl. Versandkosten., Livraison non-comprise
fermer(X)
5
Commander
sur eBook.de
€ 81,49
Commander
Détails et expédition
Lien sponsorisé
Term Rewriting and Applications - nouveau livre

2006, ISBN: 9783540368359

17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings eBook… Plus…

  - No. 25412705 Frais d'envoizzgl. Versandkosten, Livraison non-comprise
fermer(X)
1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Term Rewriting and Applications : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings
Auteur:
Titre:
ISBN:

9783540368359

Informations détaillées sur le livre - Term Rewriting and Applications : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings


EAN (ISBN-13): 9783540368359
Date de parution: 2006
Editeur: Springer

Livre dans la base de données depuis 2017-04-19T00:39:31+02:00 (Paris)
Page de détail modifiée en dernier sur 2021-06-23T13:01:01+02:00 (Paris)
ISBN/EAN: 9783540368359

ISBN - Autres types d'écriture:
978-3-540-36835-9
Autres types d'écriture et termes associés:
Titre du livre: rewriting

Données de l'éditeur

Auteur: Frank Pfenning
Titre: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Term Rewriting and Applications - 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings
Editeur: Springer; Springer Berlin
418 Pages
Date de parution: 2006-07-26
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIV, 418 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Constraint; lambda calculus; logic; optimization; proving; term rewriting; theorem proving; verification; C; Compilers and Interpreters; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Artificial Intelligence; Symbolic and Algebraic Manipulation; Computer Science; Theoretische Informatik; Künstliche Intelligenz; Mathematik für Informatiker; BC

FLoC Plenary Talk.- Formal Verification of Infinite State Systems Using Boolean Methods.- Session 1. Constraints and Optimization.- Solving Partial Order Constraints for LPO Termination.- Computationally Equivalent Elimination of Conditions.- On the Correctness of Bubbling.- Propositional Tree Automata.- Session 2. Equational Reasoning.- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems.- Unions of Equational Monadic Theories.- Modular Church-Rosser Modulo.- Session 3. System Verification.- Hierarchical Combination of Intruder Theories.- Feasible Trace Reconstruction for Rewriting Approximations.- Invited Talk.- Rewriting Models of Boolean Programs.- Session 4. Lambda Calculus.- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ?-Calculus.- A Terminating and Confluent Linear Lambda Calculus.- A Lambda-Calculus with Constructors.- Structural Proof Theory as Rewriting.- Session 5. Theorem Proving.- Checking Conservativity of Overloaded Definitions in Higher-Order Logic.- Certified Higher-Order Recursive Path Ordering.- Dealing with Non-orientable Equations in Rewriting Induction.- Session 6. System Descriptions.- TPA: Termination Proved Automatically.- RAPT: A Program Transformation System Based on Term Rewriting.- The CL-Atse Protocol Analyser.- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker.- Invited Talk.- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.- Session 7. Termination.- Predictive Labeling.- Termination of String Rewriting with Matrix Interpretations.- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.- Proving Positive Almost Sure Termination Under Strategies.- Session 8. Higher-Order Rewriting andUnification.- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.- Higher-Order Orderings for Normal Rewriting.- Bounded Second-Order Unification Is NP-Complete.
< pour archiver...