Rewriting Techniques and Applications : 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings - Taschenbuch
1989, ISBN: 3540510818
[EAN: 9783540510819], Neubuch, [SC: 8.16], [PU: Springer Berlin Heidelberg], EDV / THEORIE ALLGEMEINES; AUTOMAT; ALGORITHM; ALGORITHMS; AUTOMATEDDEDUCTION; AUTOMATEDREASONING; LAMBDACALCU… Mehr…
ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Versandkosten: EUR 8.16 Details... |
ISBN: 9783540510819
Rewriting has always played an important role in symbolic manipulation and automated deduction systems. The theory of rewriting is an outgrowth of Combinatory Logic and the Lambda Calculu… Mehr…
Orellfuessli.ch Nr. A1000359664. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 18.07) Details... |
Rewriting Techniques and Applications. 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings. Lecture notes in computer science ; Vol. 355. - Taschenbuch
1989, ISBN: 3540510818
[EAN: 9783540510819], [SC: 3.0], [PU: Springer Berlin], AUTOMATED DEDUCTION,LAMBDA CALCULUS,PROVING,AUTOMAT,TERM REWRITING,ALGORITHM,AUTOMATED REASONING,LOGIC,PROGRAMMING,SEMANTICS,PROGRA… Mehr…
ZVAB.com Antiquariat Bookfarm, Löbnitz, Germany [54905055] [Rating: 5 (von 5)] Versandkosten: EUR 3.00 Details... |
Rewriting Techniques and Applications. 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings. Lecture notes in computer science ; Vol. 355. - gebrauchtes Buch
1989, ISBN: 9783540510819
589 pages Ex-Library book in very good condition. 9783540510819 Versand D: 5,00 EUR automated deduction,lambda calculus,proving,Automat,term rewriting,algorithm,automated reasoning,logic,… Mehr…
buchfreund.de Antiquariat Bookfarm, 04509 Löbnitz Versandkosten:Versandkosten innerhalb der BRD. (EUR 5.00) Details... |
ISBN: 9783540510819
*Rewriting Techniques and Applications* - 3rd International Conference RTA-89 Chapel Hill North Carolina USA April 3-5 1989 Proceedings. Auflage 1989 / Taschenbuch für 53.49 € / Aus dem B… Mehr…
Hugendubel.de 3540510818. Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., spese di spedizione aggiuntive. (EUR 7.50) Details... |
Rewriting Techniques and Applications : 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings - Taschenbuch
1989, ISBN: 3540510818
[EAN: 9783540510819], Neubuch, [SC: 8.16], [PU: Springer Berlin Heidelberg], EDV / THEORIE ALLGEMEINES; AUTOMAT; ALGORITHM; ALGORITHMS; AUTOMATEDDEDUCTION; AUTOMATEDREASONING; LAMBDACALCU… Mehr…
ISBN: 9783540510819
Rewriting has always played an important role in symbolic manipulation and automated deduction systems. The theory of rewriting is an outgrowth of Combinatory Logic and the Lambda Calculu… Mehr…
Rewriting Techniques and Applications. 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings. Lecture notes in computer science ; Vol. 355. - Taschenbuch
1989
ISBN: 3540510818
[EAN: 9783540510819], [SC: 3.0], [PU: Springer Berlin], AUTOMATED DEDUCTION,LAMBDA CALCULUS,PROVING,AUTOMAT,TERM REWRITING,ALGORITHM,AUTOMATED REASONING,LOGIC,PROGRAMMING,SEMANTICS,PROGRA… Mehr…
Rewriting Techniques and Applications. 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings. Lecture notes in computer science ; Vol. 355. - gebrauchtes Buch
1989, ISBN: 9783540510819
589 pages Ex-Library book in very good condition. 9783540510819 Versand D: 5,00 EUR automated deduction,lambda calculus,proving,Automat,term rewriting,algorithm,automated reasoning,logic,… Mehr…
ISBN: 9783540510819
*Rewriting Techniques and Applications* - 3rd International Conference RTA-89 Chapel Hill North Carolina USA April 3-5 1989 Proceedings. Auflage 1989 / Taschenbuch für 53.49 € / Aus dem B… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Rewriting Techniques and Applications
EAN (ISBN-13): 9783540510819
ISBN (ISBN-10): 3540510818
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1989
Herausgeber: Springer Berlin Heidelberg
592 Seiten
Gewicht: 0,883 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-06-04T12:09:15+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-01-11T15:08:41+01:00 (Vienna)
ISBN/EAN: 9783540510819
ISBN - alternative Schreibweisen:
3-540-51081-8, 978-3-540-51081-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: dershowitz, goos, ders
Titel des Buches: usa, north carolina, 1989 band, lecture notes computer science, 1986, rewriting
Daten vom Verlag:
Autor/in: Nachum Dershowitz
Titel: Lecture Notes in Computer Science; Rewriting Techniques and Applications - 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings
Verlag: Springer; Springer Berlin
589 Seiten
Erscheinungsjahr: 1989-03-22
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VII, 589 p.
BC; Hardcover, Softcover / Mathematik/Grundlagen; Mathematik: Logik; Verstehen; Automat; algorithm; algorithms; automated deduction; automated reasoning; lambda calculus; logic; programming; programming language; proving; semantics; term rewriting; theorem proving; algorithm analysis and problem complexity; Mathematical Logic and Foundations; Formal Languages and Automata Theory; Symbolic and Algebraic Manipulation; Compilers and Interpreters; Algorithms; Artificial Intelligence; Mathematische Grundlagen; Theoretische Informatik; Mathematik für Informatiker; Compiler und Übersetzer; Algorithmen und Datenstrukturen; Künstliche Intelligenz; EA
Term rewriting and universal algebra in historical perspective.- Characterizations of unification type zero.- Proof normalization for resolution and paramodulation.- Complete sets of reductions modulo associativity, commutativity and identity.- Completion-time optimization of rewrite-time goal solving.- Computing ground reducibility and inductively complete positions.- Inductive proofs by specification transformations.- Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction.- Simulation of Turing machines by a left-linear rewrite rule.- Higher-order unification with dependent function types.- An overview of LP, the Larch Prover.- Graph grammars, a new paradigm for implementing visual languages.- Termination proofs and the length of derivations.- Abstract rewriting with concrete operators.- On how to move mountains ‘associatively and commutatively’.- Generalized Gröbner bases: Theory and applications. A condensation.- A local termination property for term rewriting systems.- An equational logic sampler.- Modular aspects of properties of term rewriting systems related to normal forms.- Priority rewriting: Semantics, confluence, and conditionals.- Negation with logical variables in conditional rewriting.- Algebraic semantics and complexity of term rewriting systems.- Optimization by non-deterministic, lazy rewriting.- Combining matching algorithms: The regular case.- Restrictions of congruences generated by finite canonical string-rewriting systems.- Embedding with patterns and associated recursive path ordering.- Rewriting techniques for program synthesis.- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution.- Efficient ground completion.- Extensions and comparison ofsimplification orderings.- Classes of equational programs that compile into efficient machine code.- Fair termination is decidable for ground systems.- Termination for the direct sum of left-linear term rewriting systems.- Conditional rewrite rule systems with built-in arithmetic and induction.- Consider only general superpositions in completion procedures.- Solving systems of linear diophantine equations and word equations.- SbReve2: A term rewriting laboratory with (AC)-unfailing completion.- THEOPOGLES — An efficient theorem prover based on rewrite-techniques.- Comtes — An experimental environment for the completion of term rewriting systems.- Asspegique: An integrated specification environment.- KBlab: An equational theorem prover for the Macintosh.- Fast Knuth-Bendix completion: Summary.- Compilation of ground term rewriting systems and applications (DEMO).- An overview of Rewrite Rule Laboratory (RRL).- InvX: An automatic function inverter.- A parallel implementation of rewriting and narrowing.- Morphocompletion for one-relation monoids.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780123909602 Rewriting Techniques and Applications (Unknown, Author)
- 9780123909602 Rewriting Techniques and Applications (Unknown, Author)
- 9780119602456 Peaceful Uses of Atomic Energy: 4th International Conference: Applications of Nuclear Techniques in Industry and in the Study of Natural Res (International Atomic Energy Agency)
- 9780387159768 Rewriting Techniques and Applications: Dijon, France, May 20-22, 1985 (Lecture Notes in Computer Science) (Jouannaud, Jean-Pierre (editor) ; G. Goos; J. Hartmanis)
- 9780387539041 Rewriting Techniques and Applications: 4th International Conference, Rta-91, Cumo, Italy, April 10-12, 1991 Proceedings (Book, Ronald V. (ed.))
- Rewriting Techniques and Applications (Jouannaud, J-P)
< zum Archiv...