- 3 Ergebnisse
Kleinster Preis: € 71,39, größter Preis: € 71,39, Mittelwert: € 71,39
1
Rewriting Techniques and Applications - Harald Ganzinger
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Harald Ganzinger:

Rewriting Techniques and Applications - neues Buch

ISBN: 9783540685968

This book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996. The 27 r… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Rewriting Techniques and Applications - Harald Ganzinger
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link

Harald Ganzinger:

Rewriting Techniques and Applications - neues Buch

ISBN: 9783540685968

Computer Science; Software Engineering/Programming and Operating Systems; Theory of Computation; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathemati… Mehr…

  - Versandkosten:más costos de envío, zzgl. Versandkosten
zuklappen (X)
3
Rewriting Techniques and Applications - Harald Ganzinger
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Harald Ganzinger:
Rewriting Techniques and Applications - neues Buch

ISBN: 9783540685968

Computer Science; Software Engineering/Programming and Operating Systems; Theory of Computation; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathemati… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
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
Rewriting Techniques and Applications
Autor:
Titel:
ISBN-Nummer:

9783540685968

Detailangaben zum Buch - Rewriting Techniques and Applications


EAN (ISBN-13): 9783540685968
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2016-12-27T13:48:45+01:00 (Berlin)
Detailseite zuletzt geändert am 2021-10-05T15:18:55+02:00 (Berlin)
ISBN/EAN: 9783540685968

ISBN - alternative Schreibweisen:
978-3-540-68596-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: rewriting

Daten vom Verlag:

Autor/in: Harald Ganzinger
Titel: Lecture Notes in Computer Science; Rewriting Techniques and Applications - 7th International Conference, RTA-96, New Brunswick, NJ, USA July 27 - 30, 1996. Proceedings
Verlag: Springer; Springer Berlin
440 Seiten
Erscheinungsjahr: 2005-07-14
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 440 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Automatische Deduktion; Ersetzungssysteme; Höherstufige Logiken; automated deduction; graph rewriting; higher-order logics; proving; rewriting systems; term rewriting; theorem proving; C; Software Engineering; Theory of Computation; Compilers and Interpreters; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Artificial Intelligence; Computer Science; Theoretische Informatik; Compiler und Übersetzer; Künstliche Intelligenz; BC

Rewrite-based automated reasoning: Challenges ahead.- Fine-grained concurrent completion.- AC-complete unification and its application to theorem proving.- Superposition theorem proving for abelian groups represented as integer modules.- Symideal Gröbner bases.- Termination of constructor systems.- Dummy elimination in equational rewriting.- On proving termination by innermost termination.- A recursive path ordering for higher-order terms in ?-long ?-normal form.- Higher-order superposition for dependent types.- Higher-order narrowing with definitional trees.- Design of a proof assistant.- A compiler for nondeterministic term rewriting systems.- Combinatory reduction systems with explicit substitution that preserve strong normalisation.- Confluence properties of extensional and non-extensional ?-calculi with explicit substitutions (extended abstract).- On the power of simple diagrams.- Coherence for sharing proof nets.- Modularity of termination in term graph rewriting.- Confluence of terminating conditional rewrite systems revisited.- Applications of rewrite techniques in monoids and rings.- Compositional term rewriting: An algebraic proof of Toyama's theorem.- The first-order theory of one-step rewriting is undecidable.- An algorithm for distributive unification.- On the termination problem for one-rule semi-Thue system.- Efficient second-order matching.- Linear second-order unification.- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type.- Decidable approximations of term rewriting systems.- Semantics and strong sequentially of priority term rewriting systems.- Higher-order families.- A new proof manager and graphic interface for the larch prover.- ReDuX 1.5: New facets of rewriting.- CiME: Completionmodulo E.- Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover.- EPIC: An equational language Abstract machine and supporting tools.- SPIKE-AC: A system for proofs by induction in Associative-Commutative theories.- On gaining efficiency in completion-based theorem proving.
< zum Archiv...