Titlebook: 9th International Conference on Automated Deduction; Argonne, Illinois, U Ewing Lusk,Ross Overbeek Conference proceedings 1988 Springer-Ver

FICE

Spinal-Fusion

Eli Biham,Orr Dunkelman,Nathan Keller the first such automated type-theoretic account of partiality. We demonstrate that such an environment can be used effectively for proving theorems about computability and for developing partial programs with correctness proofs. This extends the well-known proofs as programs paradigm to partial fun

彩色的蠟筆

Mohssen Alabbadi,Stephen B. Wickerions of LCF-like tactics, [Gordon . 79], and by recording these specifications in a sorted meta-logic, we are able to reason about the conjectures to be proved and the methods available to prove them. In this way we can build proof plans of wide generality, formally account for and predict their suc

發(fā)現(xiàn)