• 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

Introduction to Isabelle (1998)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.informatik.uni-bremen.de]
  • [www.cl.cam.ac.uk.]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Lawrence C. Paulson
Citations:41 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Paulson98introductionto,
    author = {Lawrence C. Paulson},
    title = {Introduction to Isabelle},
    year = {1998}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Citations

585 Isabelle/HOL: A Proof Assistant for Higher-Order Logic - Nipkow, Paulson, et al. - 2002
386 Isabelle: A generic theorem prover - Paulson - 1994
352 ML for the Working Programmer - Paulson - 1996
242 Programming in Martin-Löf’s Type Theory. An Introduction - Nordström, Petersson, et al. - 1990
216 Report on the programming language Haskell, a non-strict, purely functional language - Hudak, Jones, et al. - 1992
184 Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic - Gordon, F - 1993
173 Isabelle: The next 700 theorem provers - Paulson - 1990
169 A unication algorithm for typed calculus - Huet - 1975
157 Logic and Computation: Interactive proof with Cambridge LCF - Paulson - 1987
121 Edinburgh LCF: A Mechanised Logic of Computation - Gordon, Milner, et al. - 1979
109 Unification under a mixed prefix - Miller - 1992
98 A gentle introduction to Haskell - Hudak, Fasel - 1992
97 A unification algorithm for typed λ-calculus - Huet - 1975
90 Seventy-five problems for testing automatic theorem provers - Pelletier - 1986
59 Axiomatic Set Theory - Suppes - 1960
51 Natural deduction as higher-order resolution - Paulson - 1986
24 Type reconstruction for type classes - Nipkow, Prehofer - 1995
16 Programming in Martin-L"of's Type Theory. An Introduction - Nordstrom, Petersson, et al. - 1990
9 ML for the Working Programmer. Cambridge University Press, 2nd edition - Paulson - 1996
7 Designing a Theorem Prover - Paulson - 1992
6 Logic for Information Technology - Galton - 1990
5 Suppes. Axiomatic Set Theory - Patrick - 1972
2 Galton. Logic for Information - Antony - 1990
2 LCF: A Mechanised Logic of Computation. LNCS 78 - Edinburgh - 1979
2 Report on the programming language Haskell: A non-strict, purely functional language - Notices - 1992
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