Von dem Buch Canonical Equational Proofs (Progress in Theoretical Computer Science) haben wir 2 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Bachmair, Leo: Canonical Equational Proofs (Progress in Theoretical Computer Science) (ISBN: 9783764335557) in Englisch, Broschiert.Nur diese Ausgabe anzeigen…
100%: Bachmair: Canonical Equational Proofs (Progress in Theoretical Computer Science) (ISBN: 9780817635558) 1991, Birkhäuser Verlag, Schweiz, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
Canonical Equational Proofs (Progress in Theoretical Computer Science)
12 Angebote vergleichen
Bester Preis: € 10,30 (vom 21.10.2019)1
Symbolbild
Canonical Equational Proofs (Progress in Theoretical Computer Science) (1972)
~EN HC USISBN: 9783764335557 bzw. 3764335556, vermutlich in Englisch, Birkhauser, gebundenes Buch, gebraucht.
Von Händler/Antiquariat, Half Price Books Inc. [65444892], Dallas, TX, U.S.A.
Connecting readers with great books since 1972. Used books may not include companion materials, some shelf wear, may contain highlighting/notes, may not include cdrom or access codes. Customer service is our top priority!
Connecting readers with great books since 1972. Used books may not include companion materials, some shelf wear, may contain highlighting/notes, may not include cdrom or access codes. Customer service is our top priority!
2
Canonical Equational Proofs (Progress in Theoretical Computer Science) (1991)
EN PB NWISBN: 9780817635558 bzw. 0817635556, in Englisch, 138 Seiten, Birkhäuser, Taschenbuch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, smeikalbooks_london.
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. Paperback, Ausgabe: Softcover reprint of the original 1st ed. 1991, Label: Birkhäuser, Birkhäuser, Produktgruppe: Book, Publiziert: 1991-06-01, Freigegeben: 2013-10-04, Studio: Birkhäuser, Verkaufsrang: 7362357.
Von Händler/Antiquariat, smeikalbooks_london.
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. Paperback, Ausgabe: Softcover reprint of the original 1st ed. 1991, Label: Birkhäuser, Birkhäuser, Produktgruppe: Book, Publiziert: 1991-06-01, Freigegeben: 2013-10-04, Studio: Birkhäuser, Verkaufsrang: 7362357.
3
Canonical Equational Proofs (Progress in Theoretical Computer Science) (1991)
EN PB USISBN: 9780817635558 bzw. 0817635556, in Englisch, 138 Seiten, Birkhäuser, Taschenbuch, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, fanabba.
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. Paperback, Ausgabe: Softcover reprint of the original 1st ed. 1991, Label: Birkhäuser, Birkhäuser, Produktgruppe: Book, Publiziert: 1991-06-01, Freigegeben: 2013-10-04, Studio: Birkhäuser, Verkaufsrang: 7362357.
Von Händler/Antiquariat, fanabba.
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. Paperback, Ausgabe: Softcover reprint of the original 1st ed. 1991, Label: Birkhäuser, Birkhäuser, Produktgruppe: Book, Publiziert: 1991-06-01, Freigegeben: 2013-10-04, Studio: Birkhäuser, Verkaufsrang: 7362357.
4
Symbolbild
Canonical Equational Proofs (Progress in Theoretical Computer Science) (1991)
~EN USISBN: 9783764335557 bzw. 3764335556, vermutlich in Englisch, Birkhauser, gebraucht.
Von Händler/Antiquariat, Better World Books [51315977], Mishawaka, IN, U.S.A.
Shows some signs of wear, and may have some markings on the inside.
Shows some signs of wear, and may have some markings on the inside.
6
Canonical Equational Proofs
~EN HC USISBN: 9783764335557 bzw. 3764335556, vermutlich in Englisch, Birkenhäuser Verlag, Basel/Boston/Stuttgart, Schweiz, gebundenes Buch, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Lagernd, zzgl. Versandkosten.
Hardcover book. 135 pages. Published by Birkhauser.
Hardcover book. 135 pages. Published by Birkhauser.
8
Symbolbild
Canonical Equational Proofs (Progress in Theoretical Computer Science) (1991)
~EN USISBN: 9783764335557 bzw. 3764335556, vermutlich in Englisch, Birkhäuser Verlag, gebraucht.
Von Händler/Antiquariat, getbooks GmbH [55883480], Bad Camberg, HE, Germany.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
9
Canonical Equational Proofs (Progress in Theoretical Computer Science) (1991)
EN HC USISBN: 9783764335557 bzw. 3764335556, in Englisch, 135 Seiten, Birkhäuser Verlag, gebundenes Buch, gebraucht.
Lieferung aus: Deutschland, Auf Lager. Tatsächliche Versandkosten können abweichen.
Von Händler/Antiquariat, g/e/t/b/o/o/k/s.
Birkhäuser Verlag, Gebundene Ausgabe, Publiziert: 1991-05T, Produktgruppe: Book.
Von Händler/Antiquariat, g/e/t/b/o/o/k/s.
Birkhäuser Verlag, Gebundene Ausgabe, Publiziert: 1991-05T, Produktgruppe: Book.
10
Symbolbild
Canonical Equational Proofs (Progress in Theoretical Computer Science) (1991)
~EN USISBN: 9783764335557 bzw. 3764335556, vermutlich in Englisch, Birkhäuser Verlag, gebraucht.
Lieferung aus: Deutschland, Versandkosten nach: Deutschland.
Von Händler/Antiquariat, getbooks GmbH, [4040832].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Von Händler/Antiquariat, getbooks GmbH, [4040832].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…