## The Isabelle Reference Manual (2008)

### Cached

### Download Links

Citations: | 55 - 2 self |

### BibTeX

@MISC{Paulson08theisabelle,

author = {Lawrence C. Paulson},

title = { The Isabelle Reference Manual},

year = {2008}

}

### OpenURL

### Abstract

### Citations

718 | Isabelle/HOL — A Proof Assistant for HigherOrder Logic - Nipkow, Paulson, et al. - 2002 |

412 | Depth-first iterative-deepening: An optimal admissible tree search - Korf - 1985 |

395 |
A Computational Logic Handbook
- Boyer, Moore
- 1988
(Show Context)
Citation Context ...theory specification contains a syntax section with mixfix declarations encoding the priority grammar from x7.1: ExpSyntax = Pure + types exp syntax "0" :: exp ("0" 9) "+"=-=; :: [exp, exp] =? exp (" + " [0, 1] 0) "*" :: [exp, exp] =? exp (" * &-=-quot; [3, 2] 2) "-" :: exp =? exp ("- " [3] 3) end CHAPTER 7. DEFINING LOGICS 74 If you put this into a file ExpSyntax.thy and load it via usethy"ExpSyntax", you can run ... |

366 |
ML for the Working Programmer
- Paulson
- 1991
(Show Context)
Citation Context ... a space and followed by a space or line break; the entire phrase is a pretty printing block. Other examples appear in Fig. 8.4 below. Isabelle's pretty printer resembles the one described in Paulson =-=[9]. 7.3.4 Infixes-=- Infix operators associating to the left or right can be declared using infixl or infixr. Basically, the form c :: oe (infixl p) abbreviates the mixfix declarations "op c" :: oe ("( c/ ... |

261 |
Programming in Martin-Löf’s Type Theory: An Introduction
- Nordstrom, Petersson, et al.
- 1990
(Show Context)
Citation Context ...ting in CTT uses another simplifier, which resides in the file typedsimp.ML and is not documented. Even this does not work for later variants of Constructive Type Theory that use intensional equality =-=[8]-=-. 10.6.1 A collection of standard rewrite rules The file begins by proving lots of standard rewrite rules about the logical connectives. These include cancellation and associative laws. To prove them ... |

154 |
de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem
- G
- 1972
(Show Context)
Citation Context ...index i , which counts the number of lambdas, starting from zero, between a variable's occurrence and its binding. The representation prevents capture of variables. For more information see de Bruijn =-=[3]-=- or Paulson [9, page 336]. Abs (a, T, u) is the -abstraction with body u, and whose bound variable has name a and type T . The name is used only for parsing and printing; it has no logical significanc... |

102 |
et a!. Principles of OBJ2
- Futatsugi
(Show Context)
Citation Context ...n. Mixfix annotations allow you to extend Isabelle's basic -calculus syntax with readable notation. They can express any context-free priority grammar. Isabelle syntax definitions are inspired by obj =-=[4]-=-; they are more general than the priority declarations of ml and Prolog. A mixfix annotation defines a production of the priority grammar. It describes the concrete syntax, the translation to abstract... |

98 |
Seventy-Five Problems for Testing Automatic Theorem Provers
- Pelletier
- 1986
(Show Context)
Citation Context ...simple, non-clausal proof procedure. They are slow and simplistic compared with resolution theorem provers, but they can save considerable time and effort. They can prove theorems such as Pelletier's =-=[11]-=- problems 40 and 41 in seconds: (9y : 8x : J (y ; x ) $ :J (x ; x )) ! :(8x : 9y : 8z : J (z ; y) $ :J (z ; x )) (8z : 9y : 8x : F (x ; y) $ F (x ; z )s:F (x ; x )) ! :(9z : 8x : F (x ; z )) The tacti... |

70 | Type classes and overloading in higher-order logic - Wenzel - 1997 |

61 |
Functional unification of higher-order patterns
- Nipkow
- 1993
(Show Context)
Citation Context ...te rules: those where all unknowns are of base type. Hence ?i + (?j + ?k) = (?i + ?j ) + ?k is ok. It will also deal gracefully with all rules whose left-hand sides are so-called higherorder patterns =-=[6]-=-. These are terms in fi-normal form (this will always be the case unless you have done something strange) where each occurrence of an unknown is of the form ?F (x 1 ; : : : ; x n ), where the x i are ... |

35 | Locales: A sectioning concept for Isabelle - Kammüller, Wenzel, et al. - 1999 |

34 | Proof terms for simply typed higher order logic - Berghofer, Nipkow - 2000 |

23 | Type reconstruction for type classes
- Nipkow, Prehofer
- 1995
(Show Context)
Citation Context ...ring on the right-hand side. More elaborate checks could be made, but the cost might be overly strict rules on declaration order, etc. 6.1.2 *Classes and arities In order to guarantee principal types =-=[7]-=-, arity declarations must obey two conditions: ffl There must not be any two declarations ty :: (~r )c and ty :: (~s )c with ~r 6= ~s . For example, this excludes the following: arities foo :: (--logi... |

22 |
Ordered Rewriting and Confluence
- Martin, Nipkow
- 1990
(Show Context)
Citation Context ...f (x ; z )). Ordered rewriting with the combination of A, C, and LC sorts a term lexicographically: (b + c) + a A 7\Gamma! b + (c + a) C 7\Gamma! b + (a + c) LC 7\Gamma! a + (b + c) Martin and Nipkow =-=[5]-=- discuss the theory and give many examples; other algebraic structures are amenable to ordered rewriting, such as boolean rings. 10.5.1 Example: sums of natural numbers This example is set in HOL (see... |

9 | ML for the Working Programmer. Cambridge University Press, 2nd edition - Paulson - 1996 |

1 | 14] Markus Wenzel. The Isabelle/Isar Reference Manual - Reas - 1986 |