Defining Recursive Functions in Isabelle/HOL
Cached
Download Links
- [mirror.cse.unsw.edu.au]
- [www.cl.cam.ac.uk]
- [isabelle.in.tum.de]
- [isabelle.in.tum.de]
- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- [isabelle.in.tum.de]
- [isabelle.in.tum.de]
- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- [isabelle.in.tum.de]
- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- [isabelle.in.tum.de]
- [isabelle.in.tum.de]
by
Alexander Krauss
| Citations: | 4 - 0 self |
BibTeX
@MISC{Krauss_definingrecursive,
author = {Alexander Krauss},
title = {Defining Recursive Functions in Isabelle/HOL},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This tutorial describes the use of the new function package, which provides general recursive function definitions for Isabelle/HOL. We start with very simple examples and then gradually move on to more advanced topics such as manual termination proofs, nested recursion, partiality, tail recursion and congruence rules. 1
Citations
| 586 | Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS - Nipkow, Paulson, et al. - 2002 |
| 21 | Function definition in higher order logic - Slind - 1996 |
| 14 | Finding lexicographic orders for termination proofs in Isabelle/HOL - Bulwahn, Krauss, et al. - 2007 |
| 11 | Partial recursive functions in Higher-Order Logic - Krauss - 2006 |
| 6 | Automating Recursive Definitions and Termination Proofs in Higher-Order Logic. PhD thesis, Institut für Informatik, Technische Universität - Krauss - 2009 |
