| 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
|