generalize bdd_above/below_uminus to ordered_ab_group_add

restrict Limsup and Liminf to complete lattices

use INF and SUP on conditionally complete lattices in multivariate analysis

add SUP and INF for conditionally complete lattices

use bdd_above and bdd_below for conditionally complete lattices

generalize SUP and INF to the syntactic type classes Sup and Inf

added some N2M caching

also generalize fixed types

generalize types when synthetizing n2m (co)recursors, to facilitate reuse

nicer error message in case of duplicates

use int example like in the rest of IMP (instead of nat)

dropped dead code

fact generalization and name consolidation

streamlined setup of linear arithmetic

make 'try0' return faster when invoked as part of 'try'

careful with lists of different lengths

split 'primrec_new' and 'primcorec' code (to ease bootstrapping, e.g. dependency on datatype 'String' in 'primcorec')

better error handling

more robust treatment of dead variables in n2m

more robust n2m w.r.t. 'let's

tuning

strengthened tactic

made n2m code more robust w.r.t. advanced constructs (e.g. lambdas)

handle constructor syntax in n2m primcorec

typo

made sugared 'coinduct' theorem construction n2m-proof

moved code around

tuning

make code more robust w.r.t. applied/unapplied map (primrec vs. primcorec)

conceal definition

more exercises

more exercises

more simplification rules on unary and binary minus

generate stable names for axioms

purely algebraic foundation for even/odd

moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas; tuned presburger

explicit type class for modelling even/odd parity

generalized of_bool conversion

separated bit operations on type bit from generic syntactic bit operations

restructed

generalised lemma

more lemmas on division

more convenient place for a theory in solitariness

consolidated clone theory

more exercises

tuned text

inst_lift now fully instantiates context to avoid problems with loose bound variables

include corecursive functions' arguments in callssss

more exercises

merged

more exercises

commented out vaporware

more exercises

tuning

tuning

tuned names (to make them independent from temporary naming convention used in characteristic theorems)

align 'primrec_new' on 'primcorec' (+ got rid of one more 'dummyT')

convenience: handle composition gracefully in map in 'primcorec', analogously to 'primrec_new'

tuned error message

more exercises

handle applied ctor arguments gracefully when computing 'callssss' (for recursion through functions)

tuning

more correct (!) types for recursive calls

watch out for 'case' constant canditates whose general type is 'a (e.g. 'undefined')

got rid of annoying duplicate rewrite rule warnings

use definitions for LEO-II as well -- this simplifies the code and matches some users' expectations

refactored rtrancl_while; prove termination for finite rtrancl

more exercises

added exercises

added 'primcorec' examples

tuned

removed junk

update doc according to c0186a0d8cb3

define a trivial nonemptiness witness if none is provided

made lower-level function available

more doc -- feedback from Andrei P.

added exercise

more docs

more docs

more docs

expand doc a bit

updated doc

tuning

warn about incompatible recursor signature

more informative abort

tuning

systematically close derivations in BNF package

removed temporary error handling

strengthened tactic

tuning

reintroduced parts of 07a8145aaeba that a22ded8a7f7d wrongly took out

tuning

gracefully handle case where a nested recursive variable appears directly on the rhs of a primcorec equation

tuning

tuning

tuning

tuning

simplify code

avoid tactic failure for equations that contain an unapplied 'id'

improve support for recursion through functions

handle composition for multiple arguments correctly

merge

generate callssss

set stage for more flexible 'primrec' syntax for recursion through functions

don't print BNF constants

tuning

conceal even more ugly constructions

conceal more ugly constructions

conceal prim(co)rec definitions

avoid 'co_' prefix with underscore meaning 'co', since it is our only possible identifier representation of '(co)'

updated docs

set code attribute on discriminator equations

MaSh error handling

repair invariant in MaSh when learning new proofs

killed more "no_atp"s

killed most "no_atp", to make Sledgehammer more complete

doc fixes suggested by Andreas L.

make sure that registered code equations are actually equations

accept very long lines in MaSh

make sure add: doesn't add duplicates, and works for [no_atp] facts

no fact subsumption -- this only confuses later code, e.g. 'add:'

generate a comment storing the goal nickname in "learn_prover"

clarified message

added thread-safety warnings

avoid confusion between outer ifs and inner ifs, that caused tactic to go berserk

handle nested tuples in 'let's

more exercises

also unfold let (_, _) = ... syntax

added helper function (that solves chicken-and-egg problem w.r.t. "callssss")

graceful handling of abort

generalized interface

choose facts to reprove more randomly, to avoid getting stuck with impossible problems at first

thread the goal through instead of relying on unreliable (possibly fake) state

added comment

tuning

verbose minimization when learning from ATP proofs

if slicing is disabled, pick the maximum number of facts, not the number of facts in the last slice

if slicing is disabled, don't enforce last slice's "max_facts", but rather the maximum "max_facts"

fast track -- avoid domain error in 0 case

remove overloading of "max_facts" -- it already controls the number of facts passed to ATPs for 'learn_prover'

merged

tuned exercises

use Code.abort instead of undefined in auto-generated equations

have MaSh minimize

tweaked signature

strengthened tactic to deal with 'False ==> ...'

made theorem extraction code not delve too far when looking at local fact, by relying on 'strip_thm' instead of (wrongly) reverse-engineering proof terms

improved duplicate detection in "build_name_tables" by ensuring that the earliest occurrence of a duplicate (if it exists) gets picked as the canonical instance

updated S/H docs

use MePo with Auto Sledgehammer, because it's lighter than MaSh and always available

drop only real duplicates, not subsumed facts -- this confuses MaSh

renamed relcomp_def to relcomp_unfold

fixed thm names

addressed rare case where the same symbol would be treated alternately as a function and as a predicate -- adding "top2I top_boolI" to a problem that didn't talk about "top" was a way to trigger the issue

added Nitpick limitations to docs

more defensive Nitpick setup -- exotic types of recursion are not supported yet in the model finder

keep temporary error handling in there until code equations are properly generated

tuning (simplified parts of 92c5bd3b342d)

tuning

stengthened tactic to cope with abort cases

tuned names

strengthened tactic w.r.t. "let"

more prominent MaSh errors

compile -- fix typo introduced in 07a8145aaeba

pass the right theorems to tactic

prove user-supplied equations for ctr and code reductions, preserving "let"s, "case"s etc.; generate code-style theorems (currently commented out since this still fails for many cases); filter tautologies (False ==> ...) out of generated theorems;

repaired confusion between the stated and effective fact filter -- the mismatch could result in "Match" exceptions

simplify fudge factor code

cleanup SMT-related config options

no isar proofs if preplay was not attempted

normalize more equalities

parallelize MeSh

run relevance filter only once for ATPs and SMT solvers, since it should now yield the same results anyway

use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)

minor performance tuning

use plain types instead of dedicated type pattern

duplicate term and type patterns

optimized built-in const check

added TODO

crank up limit a bit -- truly huge background theories are still nearly 3 times larger

higher minimum relevance threshold, to prevent Sledgehammer from taking too long on "lemma False"

minor fact filter speedups

more gracefully handle huge theories in relevance filters

handle huge MaSh requests gracefully

further optimization in relevance filter

further speed up duplicate elimination

more efficient theorem variable normalization

strengthened constructor-view tactic to deal with 'let's

allow 'let's around constructors in constructor view

reword abstract

more primcorec docs

minor doc fix

new topological lemmas; tuned proofs

strengthen the tactics to bring them in sync with the simplifications taking place in the code (and weaken the simplifications a bit -- let's not deal with implies)

generate optimized DNF formula

rationalized negation code

honor externally set MASH_PORT

process code-style inputs

more tracing

more thorough spying

more Sledgehammer spying -- record fact indices

prevent explosion in monomorphizer (e.g. when the facts typerep_int_def typerep_num_def typerep_option_def typerep_node_def are selected)

removed pointless special case

run fewer provers in "try" mode

count remote threads as well when balancing CPU usage -- otherwise jEdit users and other users of the "blocking" mode may have to wait for 2 * timeout if they e.g. have 4 cores and 5 provers (the typical situation)

more parallelism in blocking mode

more robustness in MaSh

back to post-release mode -- after fork point;

tuned;

tuned;

more notes;

tuned;

added and generalised lemmas

Streamlined locales reference material.

merged

tuned

merged

keep the qualification of bindings when noting bnf theorems

strengthened tactic (primcorec_sel_tac) + tuning

renamings

got rid of needless argument

make SMT integration slacker w.r.t. bad apples (facts)

strengthen top sort check

tuned whitespace;

tuned;

unset XMODIFIERS by default, in order to prevent total loss of key events seen on Fedora 18/19;

updated to scala-2.10.3;

tuned;

some highlights of Isabelle2013-1 based on NEWS;

tuned;

misc tuning for release;

more (co)data docs

don't register equations of the form 'f x = ...' as simp rules, even if they are safe (noncorecursive), because they unfold too aggresively concepts users are likely to want to stay folded

NEWS and CONTRIBUTORS

made SML/NJ happy

use new coinduction method and primcorec in examples

new coinduction method

tuned command descriptions

strengthen tactic w.r.t. let

minor doc fix (there is no guarantee that the equations for a given f_i are contiguous in the collection)