Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary
|
shortlog
|
changelog
| graph |
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
less
more
|
(0)
-30000
-10000
-3000
-1000
-300
-100
-60
+60
+100
+300
+1000
+3000
+10000
tip
Find changesets by keywords (author, files, the commit message), revision number or hash, or
revset expression
.
The revision graph only works with JavaScript-enabled browsers.
reverted check introduced in ce58fb149ff6, now that independent functions are allowed (cf. 347c3b0cab44)
2013-11-11, by blanchet
tuned signature
2013-11-11, by blanchet
handle independent functions defined in parallel in N2M (in presence of type variables, see ce58fb149ff6)
2013-11-11, by traytel
tuned
2013-11-11, by nipkow
tuned
2013-11-11, by nipkow
qualifed popular user space names
2013-11-10, by haftmann
dropped obsolete check: dest_num always yields positive number
2013-11-10, by haftmann
simplified: negative number is trivially smaller than 2, and SMT_Builtin.is_builtin_num implies that its argument is a number
2013-11-10, by haftmann
more exercises
2013-11-08, by nipkow
by (auto ...)[1] not by (auto [1])
2013-11-08, by blanchet
added exercise
2013-11-08, by nipkow
Add output translation for <a := .., b := .., ..> state notation.
2013-11-07, by kleing
reintroduce mutually (co)rec check, since the underlying N2M code doesn't quite handle the general case (esp. in presence of type variables)
2013-11-07, by blanchet
more docs
2013-11-07, by blanchet
properly detect when to perform n2m -- e.g. handle the case of two independent functions on irrelevant types being defined in parallel
2013-11-07, by blanchet
reverted 3e1d230f1c00 -- pervasiveness is useful, cf. Coinductive_Nat in the AFP
2013-11-06, by blanchet
simplified code
2013-11-06, by blanchet
fourth attempt at generalizing N2M types (to leverage caching)
2013-11-06, by blanchet
tuning
2013-11-06, by blanchet
int and nat are conditionally_complete_lattices
2013-11-05, by hoelzl
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'
2013-11-06, by blanchet
removed dead code
2013-11-06, by blanchet
update docs
2013-11-06, by blanchet
take out possibility of moving corecursive calls past constructors -- this doesn't work in the general case
2013-11-06, by blanchet
took out loopy code
2013-11-06, by blanchet
take out even less aggressive generalization -- it's still too aggressive
2013-11-06, by blanchet
reverted too aggressive 7cb8442298f0
2013-11-06, by blanchet
generalize more aggressively
2013-11-06, by blanchet
avoid subtle failure in the presence of top sort
2013-11-05, by blanchet
tuning
2013-11-05, by blanchet
get mutually recursive maps as well
2013-11-05, by blanchet
tuned proofs in Approximation
2013-11-05, by hoelzl
fixed subtle name shadowing bug
2013-11-05, by blanchet
use right permutation in 'map2'
2013-11-05, by blanchet
stronger normalization, to increase n2m cache effectiveness
2013-11-05, by blanchet
make local theory operations non-pervasive (makes more intuitive sense)
2013-11-05, by blanchet
NEWS
2013-11-05, by hoelzl
move Lubs from HOL to HOL-Library (replaced by conditionally complete lattices)
2013-11-05, by hoelzl
generalize bdd_above/below_uminus to ordered_ab_group_add
2013-11-05, by hoelzl
restrict Limsup and Liminf to complete lattices
2013-11-05, by hoelzl
use INF and SUP on conditionally complete lattices in multivariate analysis
2013-11-05, by hoelzl
add SUP and INF for conditionally complete lattices
2013-11-05, by hoelzl
use bdd_above and bdd_below for conditionally complete lattices
2013-11-05, by hoelzl
generalize SUP and INF to the syntactic type classes Sup and Inf
2013-11-05, by hoelzl
added some N2M caching
2013-11-05, by blanchet
also generalize fixed types
2013-11-05, by blanchet
generalize types when synthetizing n2m (co)recursors, to facilitate reuse
2013-11-05, by blanchet
nicer error message in case of duplicates
2013-11-05, by blanchet
use int example like in the rest of IMP (instead of nat)
2013-11-05, by kleing
dropped dead code
2013-11-04, by haftmann
fact generalization and name consolidation
2013-11-04, by haftmann
streamlined setup of linear arithmetic
2013-11-04, by haftmann
make 'try0' return faster when invoked as part of 'try'
2013-11-04, by blanchet
careful with lists of different lengths
2013-11-04, by blanchet
split 'primrec_new' and 'primcorec' code (to ease bootstrapping, e.g. dependency on datatype 'String' in 'primcorec')
2013-11-04, by blanchet
better error handling
2013-11-04, by blanchet
more robust treatment of dead variables in n2m
2013-11-04, by traytel
more robust n2m w.r.t. 'let's
2013-11-04, by blanchet
tuning
2013-11-04, by blanchet
strengthened tactic
2013-11-04, by blanchet
less
more
|
(0)
-30000
-10000
-3000
-1000
-300
-100
-60
+60
+100
+300
+1000
+3000
+10000
tip