Canonical Equational Proofs / Progress in Theoretical Computer Science (PDF)
(Sprache: Englisch)
Equations occur in many computer applications, such as symbolic compu tation, functional programming, abstract data type specifications, program verification, program synthesis, and automated theorem proving. Rewrite systems are directed equations used to...
Leider schon ausverkauft
eBook (pdf)
53.49 €
26 DeutschlandCard Punkte sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Canonical Equational Proofs / Progress in Theoretical Computer Science (PDF)“
Equations occur in many computer applications, such as symbolic compu tation, functional programming, abstract data type specifications, program verification, program synthesis, and automated theorem proving. Rewrite systems are directed equations used to compute by replacing subterms in a given formula by equal terms until a simplest form possible, called a normal form, is obtained. The theory of rewriting is concerned with the compu tation of normal forms. We shall study the use of rewrite techniques for reasoning about equations. Reasoning about equations may, for instance, involve deciding whether an equation is a logical consequence of a given set of equational axioms. Convergent rewrite systems are those for which the rewriting process de fines unique normal forms. They can be thought of as non-deterministic functional programs and provide reasonably efficient decision procedures for the underlying equational theories. The Knuth-Bendix completion method provides a means of testing for convergence and can often be used to con struct convergent rewrite systems from non-convergent ones. We develop a proof-theoretic framework for studying completion and related rewrite based proof procedures. We shall view theorem provers as proof transformation procedures, so as to express their essential properties as proof normalization theorems.
Bibliographische Angaben
- Autor: Bachmair
- 2013, 1991, 138 Seiten, Englisch
- Verlag: Birkhäuser Boston
- ISBN-10: 146847118X
- ISBN-13: 9781468471182
- Erscheinungsdatum: 08.03.2013
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 12 MB
- Mit Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "Canonical Equational Proofs / Progress in Theoretical Computer Science"
0 Gebrauchte Artikel zu „Canonical Equational Proofs / Progress in Theoretical Computer Science“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Canonical Equational Proofs / Progress in Theoretical Computer Science".
Kommentar verfassen