antiquotations: added options short_names, unique_names;

improved naming of complex theorems in presentation; typedef: sorts *are* allowed, but only on the rhs;

removed;

tuned;

tuned;

tuned;

tuned;

Infinite chains in definitions are now detected, too.

typo

updated para on searching

added \nexists

Removes an inconsistent definition from Library.thy , so that the lexical order is the standard order for lists. The prefix order is not built any more.

Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).

make COPYRIGHT file available for web page

path /home/stud doesn't exist on macbroy33 (only /usr/stud)

SML/NJ compatibility.

Typo.

Deleted old code.

Locale expressions: rename with optional mixfix syntax.

Add back rudely removed and popular -X option.

Now uses File.write and File.append

removed obsolete theorems

use TypedefPcpo for all class instances

log more failure types

added lemmas monofun_lub_fun and cont_lub_fun

put global isatest settings in one file, sourced by the other scripts

Use TypedefPcpo theorem for po instance

use thelub_const lemma

added lemma thelub_const

further tweaks to the SPASS setup

goodby to modUnix

trying to set up portable calling sequences for SPASS and tptp2X

cleaned up select_match do not return trivial matches made simp: t work

Narrower version of the Proof General's head; removal of the alternative icon and environment

Narrower version of the Proof General's head

rewrote continuous isomorphism section, cleaned up

cleaned up, added UU_app and less_funI, removed some obsolete stuff

added defaultsort declaration, moved cpair_less to Cprod.thy

added defaultsort declaration

cleaned up, added cpair_less and cpair_eq_pair, removed some obsolete stuff

removed dependence on Cfun.thy

moved adm_chfindom from Adm.thy to Fix.thy, to remove dependence on Cfun

new Brouwer ordinal example

more cleanup

tuned thm_style section

added ? explanations

renamed search criterion 'rewrite' to 'simp'

SML/NJ compatibility

new environments for Proof General notes

removed obsolete findI, findE, findEs (and the functions they depended on in Isar/find_theorems)

removed LICENCE note -- everything is subject to Isabelle licence as stated in COPYRIGHT file;

*** empty log message ***

grammar

shorted proof that lift is chfin

Removed shell variables. Now uses isatool getenv -b SPASS_HOME.

Generic version of spassshell. Add SPASS_HOME to .bashrc so that shell script can find it.

ML_idf antiquotation

oracle example converted to Isar

cannot have files named adm.ML and Adm.ML on Macs, so deleted one and renamed the other

A new structure and reduced indentation

Simplified version of strict sum theory, using TypedefPcpo

Simplified version of strict product theory, using TypedefPcpo

New theory for defining subtypes of pcpos

added lemma cpair_eq, made cfst_strict and csnd_strict into simp rules

Moved admissibility definitions and lemmas to a separate theory

moved continuity simproc to Cfun.thy

moved continuity simproc to Cont.thy

moved theorem cont2cont_CF1L_rev2 to Cont.thy

tuned setsum rewrites

* Pure/Syntax: In schematic variable names, *any* symbol following \<^isub> or \<^isup> is now treated as part of the base name;

interpreters for lfp/gfp added

obsolete;

spassshell and testout.py are used to filter the proof part out of SPASS's output (i.e. cuts out input and search information).

tuned pretty_sg; tuned;

node_trans: revert to original transaction code (pre 1.54);

use: not a theory command!

converted back from 0..< to <.

added email

tuned trace info (depth)

simplifier trace info; Suc-intervals

some adaptions

Moved some of the clausify functions from ATP/res_clasimpset.ML to res_axioms.ML. Changed watcher.ML so that the Unix.execute and Unix.reap functions are used instead of those in modUnix.ML, and consequently removed modUnix.ML from Reconstruction.thy

tuned;

string FindTheorems.criterion;

added read_criterion/pretty_criterion; improved rule filters -- intro excludes elim rules; tuned output; tuned;

added show_dummy_patterns;

updated;

Retrieve theorems from proof context -- improved version of thms_containing by Rafal Kolanski, NICTA;

added Pure/simplifier.ML, Pure/Isar/find_theorems.ML;

moved everything related to thms_containing to find_theorems.ML; export is_known; added fact_index_of, valid_thms; gen_read': removed unused dummies option; declare_term(_syntax): canonical argument order; removed declare_terms(_syntax);

added reserved;

added ident_with;

fold ProofContext.declare_term;

added 'print_simpset'; tuned 'thms_containing'; removed 'print_intros';

added print_simpset; renamed print_thms_containing to find_theorems; removed print_intros (superceded by find_theorems intro);

added find_theorems.ML, ../simplifier.ML;

tuned terms_of_tpairs;

added string_of_thmref, selections, fact_index_of, valid_thms; moved find_matching_thms, is_matching_thm, find_intros/intros_goal/elims to Isar/find_theorems.ML; tuned

FindTheorems.print_theorems;

findI/Es/E: adapted to FindTheorems.find_XXX, results use thmref instead of string;

major tuning;

Simplifier already setup in Pure;

tuned antiquotations;

tuned thms_containing;

tuned;

moved to Pure;

moved here from Provers; removed find_rewrites (superceded by find_theorems rewrite); outer syntax moved to Pure/Isar/isar_syn.ML;

removed find_rewrites (superceded by improved thms_containing);

bug fixes for clause form transformation

converted some problems to Isar format

subst again

Skolemization of simprules and classical rules

pcpo instance for type unit

lucas - bugfix to subst in assumptions: fixed index error for conditional rules.

shortened proof of adm_disj

cleaned up and shortened some proofs

lucas - fixed subst in assumptions to count redexes from left to right.

removed update_node, which is just an instance of map_node; tuned;

tuned;

updated;