Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary
|
shortlog
|
changelog
| graph |
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
less
more
|
(0)
-10000
-3000
-1000
-300
-100
-60
+60
+100
+300
+1000
+3000
+10000
+30000
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.
* Pure/Syntax: generic interfaces for parsing and type checking;
2007-09-25, by wenzelm
Simplified proof due to improved integration of order_tac and simp.
2007-09-25, by ballarin
Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
2007-09-25, by ballarin
dropped
2007-09-25, by haftmann
ML monad support
2007-09-25, by haftmann
no cleverness for instance parameters
2007-09-25, by haftmann
added conversions for natural numbers
2007-09-25, by haftmann
datatype interpretators for size and datatype_realizer
2007-09-25, by haftmann
hide successor
2007-09-25, by nipkow
fixed haftmann bug
2007-09-24, by nipkow
added @{theory_ref};
2007-09-24, by wenzelm
added @{type_name};
2007-09-24, by wenzelm
added polymorphic_types;
2007-09-24, by wenzelm
eliminated ProofContext.read_termTs;
2007-09-24, by wenzelm
more ML antiqs;
2007-09-24, by wenzelm
localized { .. } (but only a few thms)
2007-09-24, by nipkow
renamed ML-Systems/multithreading_dummy.ML to ML-Systems/multithreading.ML;
2007-09-24, by wenzelm
renamed ML-Systems/multithreading_dummy.ML to ML-Systems/multithreading.ML;
2007-09-24, by wenzelm
replaced interrupt_timeout by TimeLimit.timeLimit (available on SML/NJ and Poly/ML 5.1);
2007-09-24, by wenzelm
removed dead code;
2007-09-23, by wenzelm
made smlnj happy;
2007-09-23, by wenzelm
tuned @{cpat};
2007-09-23, by wenzelm
added read_term_pattern/schematic/abbrev;
2007-09-23, by wenzelm
ProofContext.read_term_pattern;
2007-09-23, by wenzelm
constrain: canonical argument order;
2007-09-23, by wenzelm
tuned;
2007-09-23, by wenzelm
TypeInfer.constrain: canonical argument order;
2007-09-23, by wenzelm
tuned ML setup;
2007-09-23, by wenzelm
tuned one proof so to not run in a loop with the new atom-representation
2007-09-23, by urbanc
changed the representation of atoms to datatypes over nats
2007-09-23, by urbanc
ProofContext.mode_abbrev;
2007-09-22, by wenzelm
removed obsolete set_expand_abbrevs (superceded by mode_abbrev);
2007-09-22, by wenzelm
certify': proper do_expand argument (which observes force_expand consts) instead of home-grown normalize;
2007-09-22, by wenzelm
certify: do_expand as explicit argument, actually certify type of abstractions;
2007-09-22, by wenzelm
tuned;
2007-09-21, by wenzelm
added has_abs (from envir.ML);
2007-09-21, by wenzelm
Term.has_abs;
2007-09-21, by wenzelm
proper signature constraint;
2007-09-21, by wenzelm
added interrupt_timeout;
2007-09-20, by wenzelm
Generic interpretation of theory data.
2007-09-20, by wenzelm
tuned signature;
2007-09-20, by wenzelm
avoid Theory.rep_theory;
2007-09-20, by wenzelm
added interpretation.ML;
2007-09-20, by wenzelm
improved error behaviour of use (bootstrap version);
2007-09-20, by wenzelm
more precise treatment of free dictionary parameters for evaluation
2007-09-20, by haftmann
fixed cg setup
2007-09-20, by haftmann
restored ml system independence
2007-09-20, by haftmann
more permissive
2007-09-20, by haftmann
clarified code lemmas
2007-09-20, by haftmann
fixed wrong syntax treatment in class target
2007-09-20, by haftmann
code lemmas for cardinality
2007-09-20, by haftmann
- eval_term no longer computes result during compile time
2007-09-20, by berghofe
improved computing
2007-09-20, by obua
changed lemmas
2007-09-20, by obua
ml_output: proper error instead of error_msg;
2007-09-19, by wenzelm
comment added to explain a potential scheduling problem
2007-09-19, by webertj
tuned
2007-09-19, by nipkow
*** empty log message ***
2007-09-19, by nipkow
metis too slow
2007-09-19, by paulson
move at-sml-dev to 2-processor atbroy100
2007-09-19, by isatest
less
more
|
(0)
-10000
-3000
-1000
-300
-100
-60
+60
+100
+300
+1000
+3000
+10000
+30000
tip