wenzelm [Tue, 09 Mar 2010 23:29:04 +0100] rev 35680
aliases for class/type/const;
tuned;
wenzelm [Tue, 09 Mar 2010 23:27:35 +0100] rev 35679
added Name_Space.alias -- additional accesses for an existing entry;
wenzelm [Tue, 09 Mar 2010 20:23:19 +0100] rev 35678
merged
haftmann [Tue, 09 Mar 2010 18:33:01 +0100] rev 35677
merged
haftmann [Tue, 09 Mar 2010 18:31:37 +0100] rev 35676
data administration using canonical functorial operations
haftmann [Tue, 09 Mar 2010 16:15:19 +0100] rev 35675
tuned data structures; using AList.map_default
haftmann [Tue, 09 Mar 2010 15:47:16 +0100] rev 35674
consistent field names; tuned interface
haftmann [Tue, 09 Mar 2010 15:47:15 +0100] rev 35673
weakend class ring_div; tuned
blanchet [Tue, 09 Mar 2010 16:40:31 +0100] rev 35672
more work on Nitpick's finite sets
blanchet [Tue, 09 Mar 2010 14:18:21 +0100] rev 35671
improved Nitpick's precision for "card" and "setsum" + fix incorrect outcome code w.r.t. "bisim_depth = -1"
wenzelm [Tue, 09 Mar 2010 14:36:41 +0100] rev 35670
ProofContext.read_class/read_type_name_proper;
wenzelm [Tue, 09 Mar 2010 14:35:02 +0100] rev 35669
added ProofContext.tsig_of -- proforma version for local name space only, not logical content;
added ProofContext.read_type_name_proper;
localized ProofContext.read_class/read_arity/cert_arity;
localized ProofContext.class_space/type_space etc.;
wenzelm [Tue, 09 Mar 2010 14:29:47 +0100] rev 35668
simplified Syntax.basic_syntax (again);
separate Syntax.type_ast_trs depending on read_class/read_type;
wenzelm [Tue, 09 Mar 2010 14:55:25 +0100] rev 35667
tuned -- eliminated Sign.intern_sort;
wenzelm [Tue, 09 Mar 2010 14:18:06 +0100] rev 35666
renamed mk_const_def to legacy_const_def, because of slightly odd Sign.intern_term;
blanchet [Tue, 09 Mar 2010 09:25:23 +0100] rev 35665
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
huffman [Mon, 08 Mar 2010 15:20:40 -0800] rev 35664
merged
huffman [Mon, 08 Mar 2010 14:42:40 -0800] rev 35663
remove unnecessary error handling code
huffman [Mon, 08 Mar 2010 14:12:51 -0800] rev 35662
construct fully typed goal in proof of induction rule
huffman [Mon, 08 Mar 2010 13:58:00 -0800] rev 35661
don't generate rule foo.finites for non-flat domains; use take_induct rule to prove induction rule
huffman [Mon, 08 Mar 2010 12:43:44 -0800] rev 35660
remove redundant function arguments
huffman [Mon, 08 Mar 2010 12:36:26 -0800] rev 35659
include take_info within take_induct_info type
huffman [Mon, 08 Mar 2010 12:21:07 -0800] rev 35658
pass take_info as an argument to comp_theorems
huffman [Mon, 08 Mar 2010 11:58:40 -0800] rev 35657
pass take_induct_info as an argument to comp_theorems
huffman [Mon, 08 Mar 2010 11:48:29 -0800] rev 35656
add type take_induct_info
huffman [Mon, 08 Mar 2010 11:34:53 -0800] rev 35655
generate take_induct lemmas
huffman [Mon, 08 Mar 2010 09:37:03 -0800] rev 35654
move proofs of reach and take lemmas to domain_take_proofs.ML
huffman [Mon, 08 Mar 2010 09:33:05 -0800] rev 35653
move lemmas from Domain.thy to Domain_Aux.thy
huffman [Mon, 08 Mar 2010 08:12:48 -0800] rev 35652
move take-proofs stuff into new theory Domain_Aux.thy
huffman [Mon, 08 Mar 2010 07:37:11 -0800] rev 35651
add type take_info