<commit_before><?xml version='1.0' encoding='iso-8859-1' ?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!-- $Id$ -->
<html xmlns="http://www.w3.org/1999/xhtml">

<head>
    <title>Overview</title>
    <?include file="//include/htmlheader.include.html"?>
</head>

<body class="main">
    <?include file="//include/header.include.html"?>
    <div class="hr"><hr/></div>
    <?include file="//include/navigation.include.html"?>
    <div class="hr"><hr/></div>
    <div id="content">
      <h2>What is Isabelle?</h2> 
      <p>
      Isabelle is a generic proof assistant. It allows mathematical
      formulas to be expressed in a formal language and provides tools
      for proving those formulas in a logical calculus.  The main
      application is the formalization of mathematical proofs and in
      particular <em>formal verification</em>, which includes proving
      the correctness of computer hardware or software and proving
      properties of computer languages and protocols.</p>
    
      <p>Compared with similar tools, Isabelle's distinguishing feature is its
      flexibility. Most proof assistants are built around a single formal calculus,
      typically higher-order logic. Isabelle has the capacity to accept a variety
      of formal calculi. The distributed version supports higher-order logic but
      also axiomatic set theory and several other formalisms. See
      <a href="logics.html">logics</a> for more details.</p>

      <p>Isabelle is a joint project between <NAME>
      (University of Cambridge, UK) and <NAME> (Technical
      University of Munich, Germany).</p>

      <h2>What Isabelle offers</h2>

        <a href="//img/isabelle_pg_screenshot_big.png">
            <img class="left" src="//img/isabelle_pg_screenshot_small.png" alt="Sreenshot "
                width="250" height="277" />
        </a>

      <p>Isabelle provides excellent notational support: new notations
      can be introduced, using normal mathematical symbols. Proofs can
      be written in a structured notation based upon traditional proof
      style, or more straightforwardly as sequences of
      commands. Definitions and proofs may include TeX source, from
      which Isabelle can automatically generate typeset documents.</p>

      <p>The main limitation of all such proof systems is that proving
      theorems requires much effort from an expert user. Isabelle
      incorporates some tools to improve the user's productivity by
      automating some parts of the proof process. In particular,
      Isabelle's <em>classical reasoner</em> can perform long chains
      of reasoning steps to prove formulas. The <em>simplifier</em>
      can reason with and about equations. Linear <em>arithmetic</em>
      facts are proved automatically.</p>

      <p>Isabelle comes with a large theory library of formally
      verified mathematics, including elementary number theory (for
      example, Gauss's law of quadratic reciprocity), analysis (basic
      properties of limits, derivatives and integrals), algebra (up to
      Sylow's theorem) and set theory (the relative consistency of the
      Axiom of Choice). Also provided are numerous examples arising
      from research into formal verification.</p>

      <p>With <em>Isar</em>, Isabelle offers a concise proof formulation language
      which enables a user to write proof scripts naturally understandable for
      both humans <em>and</em> computers.</p>
      
      <p>Isabelle is closely integrated with the <a href=
      "http://proofgeneral.inf.ed.ac.uk/">ProofGeneral</a> user interface, which
      eases the task of writing and maintaining proof scripts.</p>
      <br clear="all" />

      <h2>Preview</h2>

      <p>We provide a <a href="PG-preview.mov">hyperlinked preview</a> demonstrating
      Isabelle and ProofGeneral, in <a href="http://www.apple.com/quicktime/download/">QuickTime
      format</a>, and also as a <a href="PG-preview.pdf">non-hyperlinked preview</a> in PDF.</p>
    
      <p>Ample <a href="dist/documentation.html">documentation</a> is available
      about using Isabelle and its inner concepts, including a
      <a href="http://www4.in.tum.de/~nipkow/LNCS2283/">Tutorial</a> published by
      Springer-Verlag.</p>
    
      <h2>Projects</h2>

      <p>There is an (incomplete) list of past and present <a href=
      "http://www.cl.cam.ac.uk/Research/HVG/Isabelle/projects.html">projects</a>
      undertaken using Isabelle available.</p>

      <h2>License</h2>
          
      <p>Isabelle is distributed free of charge under the open source
      <a href="dist/Isabelle/COPYRIGHT">BSD license</a>. You may use any of our <a
      href="dist/index.html">mirrors</a> for download.</p>
    <commit_msg>fixed links<commit_after><?xml version='1.0' encoding='iso-8859-1' ?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!-- $Id$ -->
<html xmlns="http://www.w3.org/1999/xhtml">

<head>
    <title>Overview</title>
    <?include file="//include/htmlheader.include.html"?>
</head>

<body class="main">
    <?include file="//include/header.include.html"?>
    <div class="hr"><hr/></div>
    <?include file="//include/navigation.include.html"?>
    <div class="hr"><hr/></div>
    <div id="content">
      <h2>What is Isabelle?</h2> 
      <p>
      Isabelle is a generic proof assistant. It allows mathematical
      formulas to be expressed in a formal language and provides tools
      for proving those formulas in a logical calculus.  The main
      application is the formalization of mathematical proofs and in
      particular <em>formal verification</em>, which includes proving
      the correctness of computer hardware or software and proving
      properties of computer languages and protocols.</p>
    
      <p>Compared with similar tools, Isabelle's distinguishing feature is its
      flexibility. Most proof assistants are built around a single formal calculus,
      typically higher-order logic. Isabelle has the capacity to accept a variety
      of formal calculi. The distributed version supports higher-order logic but
      also axiomatic set theory and several other formalisms. See
      <a href="logics.html">logics</a> for more details.</p>

      <p>Isabelle is a joint project between <NAME>
      (University of Cambridge, UK) and <NAME> (Technical
      University of Munich, Germany).</p>

      <h2>What Isabelle offers</h2>

        <a href="//img/isabelle_pg_screenshot_big.png">
            <img class="left" src="//img/isabelle_pg_screenshot_small.png" alt="Sreenshot "
                width="250" height="277" />
        </a>

      <p>Isabelle provides excellent notational support: new notations
      can be introduced, using normal mathematical symbols. Proofs can
      be written in a structured notation based upon traditional proof
      style, or more straightforwardly as sequences of
      commands. Definitions and proofs may include TeX source, from
      which Isabelle can automatically generate typeset documents.</p>

      <p>The main limitation of all such proof systems is that proving
      theorems requires much effort from an expert user. Isabelle
      incorporates some tools to improve the user's productivity by
      automating some parts of the proof process. In particular,
      Isabelle's <em>classical reasoner</em> can perform long chains
      of reasoning steps to prove formulas. The <em>simplifier</em>
      can reason with and about equations. Linear <em>arithmetic</em>
      facts are proved automatically.</p>

      <p>Isabelle comes with a large theory library of formally
      verified mathematics, including elementary number theory (for
      example, Gauss's law of quadratic reciprocity), analysis (basic
      properties of limits, derivatives and integrals), algebra (up to
      Sylow's theorem) and set theory (the relative consistency of the
      Axiom of Choice). Also provided are numerous examples arising
      from research into formal verification.</p>

      <p>With <em>Isar</em>, Isabelle offers a concise proof formulation language
      which enables a user to write proof scripts naturally understandable for
      both humans <em>and</em> computers.</p>
      
      <p>Isabelle is closely integrated with the <a href=
      "http://proofgeneral.inf.ed.ac.uk/">ProofGeneral</a> user interface, which
      eases the task of writing and maintaining proof scripts.</p>
      <br clear="all" />

      <h2>Preview</h2>

      <p>We provide a <a href="//media/PG-preview.mov">hyperlinked preview</a> demonstrating
      Isabelle and ProofGeneral, in <a href="http://www.apple.com/quicktime/download/">QuickTime
      format</a>, and also as a <a href="//media/PG-preview.pdf">non-hyperlinked preview</a> in PDF.</p>
    
      <p>Ample <a href="dist/documentation.html">documentation</a> is available
      about using Isabelle and its inner concepts, including a
      <a href="http://www4.in.tum.de/~nipkow/LNCS2283/">Tutorial</a> published by
      Springer-Verlag.</p>
    
      <h2>Projects</h2>

      <p>There is an (incomplete) list of past and present <a href=
      "http://www.cl.cam.ac.uk/Research/HVG/Isabelle/projects.html">projects</a>
      undertaken using Isabelle available.</p>

      <h2>License</h2>
          
      <p>Isabelle is distributed free of charge under the open source
      <a href="dist/Isabelle/COPYRIGHT">BSD license</a>. You may use any of our <a
      href="dist/index.html">mirrors</a> for download.</p>
    
{'fraction_non_alphanumeric': 0.104149377593361, 'fraction_numerical': 0.008091286307053943, 'mean_word_length': 3.1413230240549828, 'pattern_counts': {'":': 0, '<': 185, '<?xml version=': 2, '>': 185, 'https://': 0, 'lorem ipsum': 0, 'www.': 10, 'xml': 4}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 4, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '785510', 'n_tokens_mistral': 2794, 'n_tokens_neox': 2605, 'n_words': 965}