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)… mais…
booklooker.de |
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… mais…
Springer.com Nr. 978-3-540-25596-3. Custos de envio:Worldwide free shipping, , DE. (EUR 0.00) Details... |
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… mais…
amazon.fr premium-books-europe Custos de envio:En stock. Les coûts d'expédition peuvent différer des coûts réels. (EUR 2.99) Details... |
Term Rewriting and Applications: 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings (Lecture Notes in Computer Science (3467)) [Soft Cover ] - Livro de bolso
2008, ISBN: 3540255966
[EAN: 9783540255963], Nouveau livre, [SC: 5.48], [PU: Springer], Books
AbeBooks.fr booksXpress, Freehold, NJ, U.S.A. [71410708] [Note: 4 (sur 5)] NEW BOOK. Custos de envio: EUR 5.48 Details... |
2005, ISBN: 9783540255963
Livro de bolso
16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2005
lehmanns.de Custos de envio:Versand in 10-14 Tagen. (EUR 0.00) Details... |
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)… mais…
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… mais…
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… mais…
Term Rewriting and Applications: 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings (Lecture Notes in Computer Science (3467)) [Soft Cover ] - Livro de bolso
2008, ISBN: 3540255966
[EAN: 9783540255963], Nouveau livre, [SC: 5.48], [PU: Springer], Books
2005, ISBN: 9783540255963
Livro de bolso
16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2005
Dados bibliográficos do melhor livro correspondente
Autor: | |
Título: | |
Número ISBN: |
Dados detalhados do livro - Term Rewriting and Applications
EAN (ISBN-13): 9783540255963
ISBN (ISBN-10): 3540255966
Livro de capa dura
Livro de bolso
Ano de publicação: 2005
Editor/Editora: Springer Berlin
536 Páginas
Peso: 0,801 kg
Língua: eng/Englisch
Livro na base de dados desde 2007-03-20T17:00:30+00:00 (Lisbon)
Página de detalhes modificada pela última vez em 2023-11-20T19:53:00+00:00 (Lisbon)
Número ISBN/EAN: 9783540255963
Número ISBN - Ortografia alternativa:
3-540-25596-6, 978-3-540-25596-3
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: giesl, jürgen bordeaux
Título do livro: japan computer, theoretical computer science, term rewriting applications, this japan, nara, rewriting lecture notes computer
Dados da editora
Autor: Jürgen Giesl
Título: 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
Editora: Springer; Springer Berlin
517 Páginas
Ano de publicação: 2005-04-07
Berlin; Heidelberg; DE
Língua: Inglês
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
Outros livros adicionais, que poderiam ser muito similares com este livro:
Último livro semelhante:
9783540320333 Term Rewriting and Applications (Jürgen Giesl)
- 9783540320333 Term Rewriting and Applications (Jürgen Giesl)
- 9783540368342 Term Rewriting and Applications (Pfenning, Frank)
- 9780538833103 Accounting for Managers: Text and Cases (William J., Jr. Bruns)
- 9783540298502 Progress in Pattern Recognition, Image Analysis and Applications: 10th Iberoamerican Congress on Pattern Recognition, CIARP 2005, Havana, Cuba, Novemb (Giesl, Jürgen)
- Term Rewriting and Applications: 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007. Proceedings (Ebook PDF) (English Edition) (Leroy (auth.), Xavier, Baader (eds.), Franz)
< Para arquivar...