| Thu, 07 Nov 2013 16:08:19 +1100 |
kleing |
Add output translation for <a := .., b := .., ..> state notation.
|
changeset |
files
|
| Thu, 07 Nov 2013 02:42:20 +0100 |
blanchet |
reintroduce mutually (co)rec check, since the underlying N2M code doesn't quite handle the general case (esp. in presence of type variables)
|
changeset |
files
|
| Thu, 07 Nov 2013 01:01:04 +0100 |
blanchet |
more docs
|
changeset |
files
|
| Thu, 07 Nov 2013 00:37:18 +0100 |
blanchet |
properly detect when to perform n2m -- e.g. handle the case of two independent functions on irrelevant types being defined in parallel
|
changeset |
files
|
| Wed, 06 Nov 2013 23:05:44 +0100 |
blanchet |
reverted 3e1d230f1c00 -- pervasiveness is useful, cf. Coinductive_Nat in the AFP
|
changeset |
files
|
| Wed, 06 Nov 2013 22:50:12 +0100 |
blanchet |
simplified code
|
changeset |
files
|
| Wed, 06 Nov 2013 22:42:54 +0100 |
blanchet |
fourth attempt at generalizing N2M types (to leverage caching)
|
changeset |
files
|
| Wed, 06 Nov 2013 21:40:41 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Tue, 05 Nov 2013 21:23:42 +0100 |
hoelzl |
int and nat are conditionally_complete_lattices
|
changeset |
files
|
| Wed, 06 Nov 2013 14:50:50 +0100 |
blanchet |
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'
|
changeset |
files
|
| Wed, 06 Nov 2013 13:00:45 +0100 |
blanchet |
removed dead code
|
changeset |
files
|
| Wed, 06 Nov 2013 13:00:16 +0100 |
blanchet |
update docs
|
changeset |
files
|
| Wed, 06 Nov 2013 12:47:50 +0100 |
blanchet |
take out possibility of moving corecursive calls past constructors -- this doesn't work in the general case
|
changeset |
files
|
| Wed, 06 Nov 2013 12:01:48 +0100 |
blanchet |
took out loopy code
|
changeset |
files
|
| Wed, 06 Nov 2013 10:35:30 +0100 |
blanchet |
take out even less aggressive generalization -- it's still too aggressive
|
changeset |
files
|
| Wed, 06 Nov 2013 01:57:22 +0100 |
blanchet |
reverted too aggressive 7cb8442298f0
|
changeset |
files
|
| Wed, 06 Nov 2013 01:06:01 +0100 |
blanchet |
generalize more aggressively
|
changeset |
files
|
| Tue, 05 Nov 2013 16:53:40 +0100 |
blanchet |
avoid subtle failure in the presence of top sort
|
changeset |
files
|
| Tue, 05 Nov 2013 16:47:10 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Tue, 05 Nov 2013 16:47:10 +0100 |
blanchet |
get mutually recursive maps as well
|
changeset |
files
|
| Tue, 05 Nov 2013 15:10:59 +0100 |
hoelzl |
tuned proofs in Approximation
|
changeset |
files
|
| Tue, 05 Nov 2013 13:23:27 +0100 |
blanchet |
fixed subtle name shadowing bug
|
changeset |
files
|
| Tue, 05 Nov 2013 12:40:58 +0100 |
blanchet |
use right permutation in 'map2'
|
changeset |
files
|
| Tue, 05 Nov 2013 11:55:45 +0100 |
blanchet |
stronger normalization, to increase n2m cache effectiveness
|
changeset |
files
|
| Tue, 05 Nov 2013 11:17:42 +0100 |
blanchet |
make local theory operations non-pervasive (makes more intuitive sense)
|
changeset |
files
|
| Tue, 05 Nov 2013 09:45:03 +0100 |
hoelzl |
NEWS
|
changeset |
files
|
| Tue, 05 Nov 2013 09:45:02 +0100 |
hoelzl |
move Lubs from HOL to HOL-Library (replaced by conditionally complete lattices)
|
changeset |
files
|
| Tue, 05 Nov 2013 09:45:00 +0100 |
hoelzl |
generalize bdd_above/below_uminus to ordered_ab_group_add
|
changeset |
files
|
| Tue, 05 Nov 2013 09:45:00 +0100 |
hoelzl |
restrict Limsup and Liminf to complete lattices
|
changeset |
files
|
| Tue, 05 Nov 2013 09:44:59 +0100 |
hoelzl |
use INF and SUP on conditionally complete lattices in multivariate analysis
|
changeset |
files
|
| Tue, 05 Nov 2013 09:44:59 +0100 |
hoelzl |
add SUP and INF for conditionally complete lattices
|
changeset |
files
|
| Tue, 05 Nov 2013 09:44:58 +0100 |
hoelzl |
use bdd_above and bdd_below for conditionally complete lattices
|
changeset |
files
|
| Tue, 05 Nov 2013 09:44:57 +0100 |
hoelzl |
generalize SUP and INF to the syntactic type classes Sup and Inf
|
changeset |
files
|
| Tue, 05 Nov 2013 05:48:08 +0100 |
blanchet |
added some N2M caching
|
changeset |
files
|
| Tue, 05 Nov 2013 05:48:08 +0100 |
blanchet |
also generalize fixed types
|
changeset |
files
|
| Tue, 05 Nov 2013 05:48:08 +0100 |
blanchet |
generalize types when synthetizing n2m (co)recursors, to facilitate reuse
|
changeset |
files
|
| Tue, 05 Nov 2013 05:48:08 +0100 |
blanchet |
nicer error message in case of duplicates
|
changeset |
files
|
| Tue, 05 Nov 2013 15:30:53 +1100 |
kleing |
use int example like in the rest of IMP (instead of nat)
|
changeset |
files
|
| Mon, 04 Nov 2013 20:10:10 +0100 |
haftmann |
dropped dead code
|
changeset |
files
|
| Mon, 04 Nov 2013 20:10:09 +0100 |
haftmann |
fact generalization and name consolidation
|
changeset |
files
|
| Mon, 04 Nov 2013 20:10:06 +0100 |
haftmann |
streamlined setup of linear arithmetic
|
changeset |
files
|
| Mon, 04 Nov 2013 18:08:47 +0100 |
blanchet |
make 'try0' return faster when invoked as part of 'try'
|
changeset |
files
|
| Mon, 04 Nov 2013 17:25:36 +0100 |
blanchet |
careful with lists of different lengths
|
changeset |
files
|
| Mon, 04 Nov 2013 16:53:43 +0100 |
blanchet |
split 'primrec_new' and 'primcorec' code (to ease bootstrapping, e.g. dependency on datatype 'String' in 'primcorec')
|
changeset |
files
|
| Mon, 04 Nov 2013 15:44:43 +0100 |
blanchet |
better error handling
|
changeset |
files
|
| Mon, 04 Nov 2013 14:54:29 +0100 |
traytel |
more robust treatment of dead variables in n2m
|
changeset |
files
|
| Mon, 04 Nov 2013 14:46:38 +0100 |
blanchet |
more robust n2m w.r.t. 'let's
|
changeset |
files
|
| Mon, 04 Nov 2013 12:40:28 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Mon, 04 Nov 2013 11:59:08 +0100 |
blanchet |
strengthened tactic
|
changeset |
files
|
| Mon, 04 Nov 2013 11:03:13 +0100 |
blanchet |
made n2m code more robust w.r.t. advanced constructs (e.g. lambdas)
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
handle constructor syntax in n2m primcorec
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
typo
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
made sugared 'coinduct' theorem construction n2m-proof
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
moved code around
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
make code more robust w.r.t. applied/unapplied map (primrec vs. primcorec)
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
conceal definition
|
changeset |
files
|
| Sat, 02 Nov 2013 17:50:28 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Sat, 02 Nov 2013 17:19:34 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Fri, 01 Nov 2013 18:51:14 +0100 |
haftmann |
more simplification rules on unary and binary minus
|
changeset |
files
|