| 書目名稱 | Canonical Equational Proofs | | 編輯 | Leo Bachmair | | 視頻video | http://file.papertrans.cn/222/221336/221336.mp4 | | 叢書名稱 | Progress in Theoretical Computer Science | | 圖書封面 |  | | 描述 | 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 | | 出版日期 | Book 1991 | | 關(guān)鍵詞 | equation; function; proof; theorem; verification | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4684-7118-2 | | isbn_softcover | 978-0-8176-3555-8 | | isbn_ebook | 978-1-4684-7118-2 | | copyright | Birkh?user Boston 1991 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 19:28
發(fā)表于 2025-3-21 16:34:59
