• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Defining Recursive Functions in Isabelle/HOL

Cached

  • Download as a PDF

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]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Alexander Krauss
Citations:4 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0

Version History

Metadata Version 0

DatumValueSource
TITLE Defining Recursive Functions in Isabelle/HOL SVM HeaderParse 0.2
AUTHOR NAME Alexander Krauss SVM HeaderParse 0.2
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 SVM HeaderParse 0.2
CITATIONS 4 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University