more docs

properly detect when to perform n2m -- e.g. handle the case of two independent functions on irrelevant types being defined in parallel

reverted 3e1d230f1c00 -- pervasiveness is useful, cf. Coinductive_Nat in the AFP

simplified code

fourth attempt at generalizing N2M types (to leverage caching)

tuning

int and nat are conditionally_complete_lattices

be more open-minded and allow needless mutual recursion for 'prim(co)rec', since we allow it for '(co)datatype' -- eventual warnings (or errors) should be centralized in 'fp_bnf'

removed dead code

update docs

take out possibility of moving corecursive calls past constructors -- this doesn't work in the general case

took out loopy code

take out even less aggressive generalization -- it's still too aggressive

reverted too aggressive 7cb8442298f0

generalize more aggressively

avoid subtle failure in the presence of top sort

tuning

get mutually recursive maps as well

tuned proofs in Approximation

fixed subtle name shadowing bug

use right permutation in 'map2'

stronger normalization, to increase n2m cache effectiveness

make local theory operations non-pervasive (makes more intuitive sense)

NEWS

move Lubs from HOL to HOL-Library (replaced by conditionally complete lattices)

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