Tobias Nipkow  Home/Search
Context Related
| www4.informatik.tumuenchen...HOL.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: diku.dk/users/skal...bibliography (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ion over pairs and tuples is merely a convenient shorthand for a more complex internal representation. Thus the internal and external form of a term may differ, which can affect proofs. If you want to avoid this complication, use fst and snd, i.e. write %p. fst p + snd p instead of %(x,y). x + y. See x?? for theorem proving with tuple patterns. CHAPTER 2. FUNCTIONAL PROGRAMMING IN HOL 18 2.6 Definitions A definition is simply an abbreviation, i.e. a new name for an existing construction. In ... (Update)
Context of citations to this paper: More
...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...
...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)...
Cited by: More
Verifying BDD Algorithms through Monadic Interpretation - Krstic, Matthews (2002) (Correct)
Inductive data types with negative occurrences in HOL - Vos, Swierstra (2002) (Correct)
Similar documents (at the sentence level):
54.2%: Isabelle HOL - The Tutorial - Nipkow (1999) (Correct)
Active bibliography (related documents): More All
0.5: Winskel is (almost) Right - Towards a Mechanized Semantics Textbook - Nipkow (1998) (Correct)
0.0: Computer Arithmetic: Logic, Calculation, and Rewriting - Benini, Nowotka, Pulley (1998) (Correct)
0.0: Representing FM in Isabelle - Blok (1994) (Correct)
Similar documents based on text: More All
0.6: Isabelle's Logics: HOL - Nipkow, Paulson, Wenzel (2000) (Correct)
0.5: Java Source and Bytecode Formalizations in Isabelle.. - Klein, Nipkow, von.. (2002) (Correct)
0.4: Owicki/Gries in Isabelle/HOL - Nipkow, Nieto (1999) (Correct)
Related documents from co-citation: More All
2: Another look at nested recursion (context) - Slind
2: University of Cambridge Computer Laboratory (context) - Norrish, in et al. - 1998
2: Computer Standards and Interfaces (context) - Papaspyrou, of - 2001
BibTeX entry: (Update)
T. Nipkow and L. Paulson. Isabelle/HOL tutorial. http://citeseer.ist.psu.edu/nipkow98isabelle.html More
@misc{ nipkow-isabelle,
author = "Tobias Nipkow",
title = "Isabelle HOL - The Tutorial",
text = "T. Nipkow and L. Paulson. Isabelle/HOL tutorial.",
url = "citeseer.ist.psu.edu/nipkow98isabelle.html" }
Citations (may not include all citations):362 ML for the Working Programmer (context) - Paulson - 1996
333 Introduction to Functional Programming (context) - Bird, Wadler - 1988
249 Volume 3: Sorting and Searching (context) - Knuth, of - 1975
51 The Isabelle Reference Manual - Paulson
43 Logic and Computation (context) - Paulson - 1987
31 Isabelle's Object-Logics - Paulson
2 and Oskar Slotosch (context) - Muller, Nipkow et al. - 1998
Documents on the same site (http://www.diku.dk/users/skalberg/papers/bibliography.html): More
All Structured Programs have Small Tree-Width and Good Register.. - Thorup (1998) (Correct)
PVS Prover Guide - Version 2.2 - Shankar, Owre, Rushby.. (Correct)
The Call-by-Need Lambda Calculus - Maraist, Odersky (1994) (Correct)
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