| Jeremie D. Wajs. Reasoning about Logic Programs Using Definitions and Induction. PhD thesis, Pennsylvania State University, 2002. |
....and future work Of course, the value of this approach to encoding object logics and the # calculus comes, in part, from the ability to automate proofs using such definitions. Jeremie Wajs and Miller have been developing a tactic style theorem prover for a logic with induction and definitions [Waj02]. This system, called Iris, is written entirely in Nadathur s Teyjus implementation [NM99] of #Prolog and appears to be the first theorem proving system to be written entirely using higher order abstract syntax (parser, printer, top level, tactics, tacticals, etc) Example proofs that we have done ....
Jeremie D. Wajs. Reasoning about Logic Programs Using Definitions and Induction. PhD thesis, Pennsylvania State University, 2002. 15
No context found.
Jeremie D. Wajs. Reasoning about Logic Programs Using Definitions and Induction. PhD thesis, Pennsylvania State University, 2002.
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