Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary
|
shortlog
|
changelog
| graph |
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
less
more
|
(0)
-10000
-3000
-1000
-120
+120
+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.
adjusted code lemmas
2007-02-23, by haftmann
continued
2007-02-23, by haftmann
dropped diagnostic switch
2007-02-23, by haftmann
Improved handling of situation when theorem in cache disagrees with theorem supplied: new clauses
2007-02-22, by paulson
Fixed print translations for quantifiers a la "ALL x>=t. P x". These used
2007-02-21, by krauss
prevent quadratic time removal of duplicates if filter list is empty (likely to have too many results)
2007-02-21, by kleing
added missing \
2007-02-20, by kleing
updated docs with new with_dups syntax for find_theorems
2007-02-20, by kleing
Remove duplicates from printed theorems in find_theorems
2007-02-20, by kleing
more precise error message in parameter unification
2007-02-19, by schirmer
Updated
2007-02-17, by aspinall
Fix <pgipquit>. Remove unused pgmlatomsN. Make showid match askids. Use string functions for showid, avoiding printwrap kludge.
2007-02-17, by aspinall
<idvalue>: add name attribute to allow unsolicited updates.
2007-02-17, by aspinall
pretty_full_theory: expose in signature.
2007-02-17, by aspinall
Clarify comment
2007-02-17, by aspinall
unified arity parser/arguments;
2007-02-16, by wenzelm
ML text: informative Output.debug only;
2007-02-16, by wenzelm
unified arity parser/arguments;
2007-02-16, by wenzelm
Replaced "raise RecError" by "primrec_err" in function
2007-02-16, by berghofe
added example for print-mode Axiom
2007-02-16, by schirmer
added print-mode Axiom to print theorems without premises with a rule on top.
2007-02-16, by schirmer
updated Makefile
2007-02-16, by krauss
start adding the attribute eqvt to some lemmas of the nominal library
2007-02-15, by narboux
changed termination goal to use object quantifier
2007-02-15, by krauss
added congruence rule for function composition
2007-02-15, by krauss
beta_eta_contract specification befor processing. These normal forms avoid unpleasant surprises later on.
2007-02-15, by krauss
continued
2007-02-14, by haftmann
class package now using Locale.interpretation_i
2007-02-14, by haftmann
clarified explanation
2007-02-14, by haftmann
cleanup
2007-02-14, by haftmann
simpliefied instance statement
2007-02-14, by haftmann
continued class tutorial
2007-02-14, by haftmann
added class "preorder"
2007-02-14, by haftmann
Added nominal_inductive keyword.
2007-02-13, by berghofe
Added new file Nominal/nominal_inductive.ML
2007-02-13, by berghofe
First steps towards strengthening of induction rules for
2007-02-13, by berghofe
Added new file nominal_inductive.ML
2007-02-13, by berghofe
Curried and exported mk_perm.
2007-02-13, by berghofe
COMP now performs a distinctness check on the multiple results before failing
2007-02-13, by paulson
improved lexicographic order termination tactic
2007-02-13, by bulwahn
added OCaml example
2007-02-10, by haftmann
Completing the bug fix from the previous update: the result of unifying type
2007-02-10, by paulson
changed representation of constants; consistent name handling
2007-02-10, by haftmann
changed representation of constants
2007-02-10, by haftmann
tuned
2007-02-10, by haftmann
new Isar command print_codesetup
2007-02-10, by haftmann
added experimental class target
2007-02-10, by haftmann
added class target stub
2007-02-10, by haftmann
internal interfaces for interpretation and interpret
2007-02-10, by haftmann
moved commands of class package here
2007-02-10, by haftmann
added class package to Isar bootstrap
2007-02-10, by haftmann
splut up code generation in two parts
2007-02-10, by haftmann
canonical interface for attributes
2007-02-10, by haftmann
changed name of interpretation linorder to order
2007-02-10, by haftmann
adjusted to changes in class package
2007-02-10, by haftmann
added outline for Isabelle library description
2007-02-10, by haftmann
adjusted to new code generator Isar commands and changes in implementation
2007-02-10, by haftmann
adjusted to new code generator Isar commands
2007-02-10, by haftmann
added references for code generator tutorial
2007-02-10, by haftmann
added antiquotation for exceptions
2007-02-10, by haftmann
updated keywords
2007-02-10, by haftmann
cterm_instantiate was calling a type instantiation function that works only for matching,
2007-02-08, by paulson
added get-functions
2007-02-08, by urbanc
Renamed member to memb to avoid confusion with member function
2007-02-07, by berghofe
Adapted to changes in Finite_Set theory.
2007-02-07, by berghofe
Adapted to new inductive definition package.
2007-02-07, by berghofe
- Adapted to new inductive definition package
2007-02-07, by berghofe
Added meta_spec to extraction_expand.
2007-02-07, by berghofe
Added functions hhf_proof and un_hhf_proof.
2007-02-07, by berghofe
Adapted to changes in Accessible_Part and Wellfounded_Recursion theories.
2007-02-07, by berghofe
Added split_rule attribute.
2007-02-07, by berghofe
Fixed bug in mk_AbsP.
2007-02-07, by berghofe
Introduction and elimination rules for <= on predicates
2007-02-07, by berghofe
- Improved handling of monotonicity rules involving <=
2007-02-07, by berghofe
Adapted to changes in Finite_Set theory.
2007-02-07, by berghofe
Adapted to changes in Finite_Set theory.
2007-02-07, by berghofe
- Adapted to new inductive definition package
2007-02-07, by berghofe
Adapted to new inductive definition package.
2007-02-07, by berghofe
Converted to predicate notation.
2007-02-07, by berghofe
Adapted to changes in List theory.
2007-02-07, by berghofe
- wfP has been moved to theory Wellfounded_Recursion
2007-02-07, by berghofe
Adapted to changes in Transitive_Closure theory.
2007-02-07, by berghofe
Adapted to new inductive definition package.
2007-02-07, by berghofe
Adapted to changes in Finite_Set theory.
2007-02-07, by berghofe
Theorems for converting between wf and wfP are now declared
2007-02-07, by berghofe
- Adapted to new inductive definition package
2007-02-07, by berghofe
Adapted to new inductive definition package.
2007-02-07, by berghofe
Adapted to changes in Transitive_Closure theory.
2007-02-07, by berghofe
Added Predicate theory.
2007-02-07, by berghofe
New theory for converting between predicates and sets.
2007-02-07, by berghofe
changes in lexicographic_order termination tactic
2007-02-07, by bulwahn
"prove" function now instantiates relation variable in order
2007-02-07, by berghofe
Made untabify function tail recursive.
2007-02-07, by berghofe
tuned matches_subterm;
2007-02-06, by wenzelm
trace/debug: avoid eager string concatenation;
2007-02-06, by wenzelm
cc: removed option -lstdc++, which seems to be unnecessry, but causes problems on some platforms;
2007-02-06, by wenzelm
pervasive exception Option;
2007-02-06, by wenzelm
added has_kind/get_kind;
2007-02-06, by wenzelm
fixed two stupid bugs of SML to do with the value restriction and missing type
2007-02-06, by urbanc
askids/qualified_thms_of_thy: version which returns names in domain of get_thm
2007-02-06, by aspinall
added eta expansion to imperative monad bind
2007-02-06, by haftmann
corrected typo introduced by me
2007-02-06, by urbanc
now obsolete
2007-02-06, by urbanc
moved the infrastructure from the nominal_tags file to nominal_thmdecls
2007-02-06, by urbanc
Exporting curried versions of tail recursive equations instead of internal ones
2007-02-05, by krauss
proper use of NameSpace.is_qualified (avoids compatibility issues of the SML B library);
2007-02-05, by wenzelm
removed non-modular comment;
2007-02-04, by wenzelm
interpretation: attempt to be more serious about name_morphism;
2007-02-04, by wenzelm
added full_naming;
2007-02-04, by wenzelm
tuned oracle interface;
2007-02-04, by wenzelm
added print_strings;
2007-02-04, by wenzelm
old-fashioned abstype ctyp/cterm/thm prevents accidental equality tests;
2007-02-04, by wenzelm
def_simproc(_i): tuned interface;
2007-02-04, by wenzelm
added cterm interface;
2007-02-04, by wenzelm
type simproc: explicitl dependency of morphism;
2007-02-04, by wenzelm
load morphism.ML later;
2007-02-04, by wenzelm
added the two renaming functions from my PhD
2007-02-03, by urbanc
added an infrastructure that allows the user to declare lemmas to be equivariance lemmas; the intention is to use these lemmas in automated tools but also can be employed by the user
2007-02-02, by urbanc
a few additions and deletions
2007-02-02, by nipkow
tuned;
2007-02-01, by wenzelm
less
more
|
(0)
-10000
-3000
-1000
-120
+120
+1000
+3000
+10000
+30000
tip