| Thu, 03 Oct 2013 17:03:20 +0200 |
wenzelm |
Added tag Isabelle2013-1-RC1 for changeset c37100233af7
|
changeset |
files
|
| Mon, 11 Nov 2013 18:25:13 +0100 |
blanchet |
reintroduced check from bd36da55d825 after all, due to hard-to-solve issues outside the N2M code
|
changeset |
files
|
| Mon, 11 Nov 2013 18:13:17 +0100 |
blanchet |
removed dead code
|
changeset |
files
|
| Mon, 11 Nov 2013 17:59:41 +0100 |
blanchet |
added check to avoid odd situations the N2M code cannot handle
|
changeset |
files
|
| Mon, 11 Nov 2013 17:40:55 +0100 |
blanchet |
reverted check introduced in ce58fb149ff6, now that independent functions are allowed (cf. 347c3b0cab44)
|
changeset |
files
|
| Mon, 11 Nov 2013 17:38:53 +0100 |
blanchet |
tuned signature
|
changeset |
files
|
| Mon, 11 Nov 2013 16:41:08 +0100 |
traytel |
handle independent functions defined in parallel in N2M (in presence of type variables, see ce58fb149ff6)
|
changeset |
files
|
| Mon, 11 Nov 2013 10:23:01 +0100 |
nipkow |
tuned
|
changeset |
files
|
| Mon, 11 Nov 2013 10:10:28 +0100 |
nipkow |
tuned
|
changeset |
files
|
| Sun, 10 Nov 2013 15:05:06 +0100 |
haftmann |
qualifed popular user space names
|
changeset |
files
|
| Sun, 10 Nov 2013 10:02:34 +0100 |
haftmann |
dropped obsolete check: dest_num always yields positive number
|
changeset |
files
|
| Sun, 10 Nov 2013 10:02:34 +0100 |
haftmann |
simplified: negative number is trivially smaller than 2, and SMT_Builtin.is_builtin_num implies that its argument is a number
|
changeset |
files
|
| Fri, 08 Nov 2013 21:40:07 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Fri, 08 Nov 2013 19:03:14 +0100 |
blanchet |
by (auto ...)[1] not by (auto [1])
|
changeset |
files
|
| Fri, 08 Nov 2013 08:59:54 +0100 |
nipkow |
added exercise
|
changeset |
files
|
| 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
|
| Thu, 31 Oct 2013 16:54:22 +0100 |
blanchet |
generate stable names for axioms
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
purely algebraic foundation for even/odd
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas;
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
explicit type class for modelling even/odd parity
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
generalized of_bool conversion
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
separated bit operations on type bit from generic syntactic bit operations
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
restructed
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
generalised lemma
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
more lemmas on division
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
more convenient place for a theory in solitariness
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
consolidated clone theory
|
changeset |
files
|
| Thu, 31 Oct 2013 11:48:45 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Wed, 30 Oct 2013 17:20:59 +0100 |
nipkow |
tuned text
|
changeset |
files
|
| Tue, 29 Oct 2013 13:48:18 +0100 |
berghofe |
inst_lift now fully instantiates context to avoid problems with loose bound variables
|
changeset |
files
|
| Tue, 29 Oct 2013 12:13:00 +0100 |
panny |
include corecursive functions' arguments in callssss
|
changeset |
files
|
| Tue, 29 Oct 2013 08:06:08 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Mon, 28 Oct 2013 10:29:56 +0100 |
nipkow |
merged
|
changeset |
files
|
| Mon, 28 Oct 2013 10:29:43 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Sun, 27 Oct 2013 19:02:26 +0100 |
blanchet |
commented out vaporware
|
changeset |
files
|
| Sat, 26 Oct 2013 23:06:40 +0200 |
nipkow |
more exercises
|
changeset |
files
|
| Sat, 26 Oct 2013 13:01:41 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sat, 26 Oct 2013 13:00:55 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sat, 26 Oct 2013 12:57:17 +0200 |
blanchet |
tuned names (to make them independent from temporary naming convention used in characteristic theorems)
|
changeset |
files
|
| Sat, 26 Oct 2013 12:54:57 +0200 |
blanchet |
align 'primrec_new' on 'primcorec' (+ got rid of one more 'dummyT')
|
changeset |
files
|
| Sat, 26 Oct 2013 12:54:39 +0200 |
blanchet |
convenience: handle composition gracefully in map in 'primcorec', analogously to 'primrec_new'
|
changeset |
files
|
| Sat, 26 Oct 2013 12:54:21 +0200 |
blanchet |
tuned error message
|
changeset |
files
|
| Fri, 25 Oct 2013 16:20:54 +0200 |
nipkow |
more exercises
|
changeset |
files
|
| Thu, 24 Oct 2013 19:43:21 +0200 |
blanchet |
handle applied ctor arguments gracefully when computing 'callssss' (for recursion through functions)
|
changeset |
files
|
| Thu, 24 Oct 2013 18:50:59 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Thu, 24 Oct 2013 18:37:54 +0200 |
blanchet |
more correct (!) types for recursive calls
|
changeset |
files
|
| Thu, 24 Oct 2013 15:56:03 +0200 |
blanchet |
watch out for 'case' constant canditates whose general type is 'a (e.g. 'undefined')
|
changeset |
files
|
| Thu, 24 Oct 2013 15:32:34 +0200 |
blanchet |
got rid of annoying duplicate rewrite rule warnings
|
changeset |
files
|
| Thu, 24 Oct 2013 12:43:33 +0200 |
blanchet |
use definitions for LEO-II as well -- this simplifies the code and matches some users' expectations
|
changeset |
files
|
| Thu, 24 Oct 2013 10:03:20 +0200 |
traytel |
refactored rtrancl_while; prove termination for finite rtrancl
|
changeset |
files
|
| Wed, 23 Oct 2013 21:12:20 +0200 |
nipkow |
more exercises
|
changeset |
files
|
| Wed, 23 Oct 2013 18:04:43 +0200 |
nipkow |
added exercises
|
changeset |
files
|
| Wed, 23 Oct 2013 14:53:36 +0200 |
blanchet |
added 'primcorec' examples
|
changeset |
files
|
| Wed, 23 Oct 2013 09:58:30 +0200 |
nipkow |
tuned
|
changeset |
files
|
| Tue, 22 Oct 2013 16:07:09 +0200 |
traytel |
removed junk
|
changeset |
files
|
| Tue, 22 Oct 2013 14:22:06 +0200 |
traytel |
update doc according to c0186a0d8cb3
|
changeset |
files
|
| Tue, 22 Oct 2013 14:17:12 +0200 |
traytel |
define a trivial nonemptiness witness if none is provided
|
changeset |
files
|
| Mon, 21 Oct 2013 23:45:27 +0200 |
blanchet |
made lower-level function available
|
changeset |
files
|
| Mon, 21 Oct 2013 23:35:57 +0200 |
blanchet |
more doc -- feedback from Andrei P.
|
changeset |
files
|
| Mon, 21 Oct 2013 21:06:19 +0200 |
nipkow |
added exercise
|
changeset |
files
|
| Mon, 21 Oct 2013 10:49:02 +0200 |
blanchet |
more docs
|
changeset |
files
|