S. Vadera. Generalisation for induction. Technical report, Department of Computer Science, University of Manchester, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....by unification command will perform the second part. This leaves the simplification component, but this may be done via rewriting, which we discuss further in the next section. We finally note that the strategy described above has an advantage over the general theoretical results of Vadera [12] for generalisation of theorems involving accumulator functions, in that his approach involves the synthesis of initially unknown functions. For example, a variation of append that reverses its arguments would need to be synthesised for the above example. On the other hand, Kapur and Sivakumar s ....

S. Vadera. Generalisation for induction. Technical report, Department of Computer Science, University of Manchester, 1993.

.... conjecture is often easier to prove, principally because instances of the conjecture are used as inductive hypotheses and thus are themselves more general than those allowed by the original conjecture (or subgoal) Many strategies have been proposed for generating appropriate generalisations [7, 33]. Our principal concern will be to select the methods most appropriate for the type of problems we will be dealing with in reasoning about Z specifications, to tailor them to the needs of CADiZ, and then to implement them via tactics. Another approach to the generation of lemmas, implicitly used ....

S. Vadera. Generalisation for induction. Technical report, Department of Computer Science, University of Manchester, 1993.

No context found.

S. Vadera. A theory of unification. Master's thesis, Department of Computer Science, University of Manchester, July 1986.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC