A Computational Logic Handbook was published in 1988 and is an acknowledged classic in the field of formal methods and computational logic. This revised edition describes the new syntax, including COND, CASE, LET, LIST* and backquote; depicts some higher order inference procedures, including 'constrained functions' and 'functional instantiation'; documents more sophisticated control machinery for manipulating very large theories and introduces a secure proof-checking environment; provides a formal parser for the syntax and compares the proof complexity of many checked examples; includes much new tutorial help, especially for the new features. This book is essential to the user of the Boyer-Moore theorem-prover because it provides both the only statement of the logic and the only explanation of the available user commands.The user visible state consists of 8 data registers, 8 address registers, a 32-bit program counter, an 8-bit condition code register (which includes condition codes for carry, overflow, zero, negative, and extend), and memory. Semantics areanbsp;...
|Title||:||A Computational Logic Handbook|
|Author||:||Robert S. Boyer, J. Strother Moore|