T. Nipkow and L. Paulson. Isabelle/HOL tutorial. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Verifying BDD Algorithms through Monadic Interpretation - Krstic, Matthews (2002) (Correct)
....level i 1; the level zero of the BDD table is reserved for TrueNode and FalseNode. 5 Modeling Recursive Programs (Apply) The definition of Apply and the proof of the corresponding recursion theorem is the most di#cult part of this work. Even though Isabelle has a sophisticated recdef mechanism [NP] for recursive definitions with user supplied well founded relation or a measure function to justify termination, this method is di#cult to apply in our case, mostly because of nested recursion we have to deal with. Pondering the definition in Section 2, one realizes that even a hand proof of ....
T. Nipkow and L. Paulson. Isabelle/HOL tutorial.
Verifying BDD Algorithms through Monadic Interpretation - Krstic, Matthews (2002) (Correct)
....the level i 1; the level zero of the BDD table is reserved for TrueNode and FalseNode. 5 Modeling Recursive Programs (Apply) The de nition of Apply and the proof of the corresponding recursion theorem is the most dicult part of this work. Even though Isabelle has a sophisticated recdef mechanism [NP] for recursive de nitions with user supplied well founded relation or a measure function to justify termination, this method is dicult to apply in our case, mostly because of nested recursion we have to deal with. Pondering the de nition in Section 2, one realizes that even a hand proof of ....
T. Nipkow and L. Paulson. Isabelle/HOL tutorial.
Inductive data types with negative occurrences in HOL - Vos, Swierstra (2002) (1 citation) Self-citation (Hol) (Correct)
....have a set theoretic interpretation when the negative occurrence models only nite sets. Subsequently, we show how such data types can be manually added to higher order logic using equivalence sets. 1 Introduction In theorem proving systems for higher order logics such as HOL [GM93] Isabelle [NPW02] and PVS [ORR 96] tools are provided that automatically generate the theorems and de nitions necessary to add inductive (or recursive) data types. Systems like PVS [OS93] use an axiomatic approach, i.e. the properties are generated syntactically only and introduced into the theory as axioms. ....
....types to HOL that do not fall exactly into the class of data types of the form (1.1) satisfying (1) till (4) but that do have a sound set theoretic interpretation. Although in this paper we have concentrated mainly on the theorem prover HOL [GM93] our proofs are easily repeated within Isabelle [NPW02] since the latter contains the same type de nition mechanism as HOL. Moreover, since we have veri ed the results in higher order logic using a de nitional approach the results can be trusted, and hence can be added as axioms to a theorem prover like PVS that use axiomatic approaches. All ....
T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: The Tutorial, volume 2283 of LNCS. Springer, 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