Wed, 13 Nov 2002 15:36:06 +0100 berghofe - exported functions etype_of and mk_typ
Wed, 13 Nov 2002 15:35:15 +0100 berghofe Fixed name clash problem in forall_elim_var.
Wed, 13 Nov 2002 15:34:35 +0100 berghofe Added simple_prove_goal_cterm.
Wed, 13 Nov 2002 15:34:01 +0100 berghofe Removed (now unneeded) declarations of realizers for bar induction.
Wed, 13 Nov 2002 15:32:41 +0100 berghofe New package for constructing realizers for introduction and elimination
Wed, 13 Nov 2002 15:31:14 +0100 berghofe - No longer applies norm_hhf_rule
Wed, 13 Nov 2002 15:28:41 +0100 berghofe prove_goal' -> Goal.simple_prove_goal_cterm
Wed, 13 Nov 2002 15:27:27 +0100 berghofe name_of_type now replaces non-identifiers by dummy names.
Wed, 13 Nov 2002 15:26:19 +0100 berghofe Added inductive_realizer.
Wed, 13 Nov 2002 15:25:17 +0100 berghofe Added InductiveRealizer package.
Wed, 13 Nov 2002 15:24:42 +0100 berghofe Transitive closure is now defined inductively as well.
Sat, 09 Nov 2002 00:12:25 +0100 kleing Hoare.ML -> hoare.ML
Fri, 08 Nov 2002 10:34:40 +0100 paulson Polishing.
Fri, 08 Nov 2002 10:28:29 +0100 paulson generalized wf_on_unit to wf_on_any_0
Thu, 07 Nov 2002 12:35:34 +0100 nipkow added raw proof blocks
Thu, 07 Nov 2002 09:26:44 +0100 nipkow small improvements
Thu, 07 Nov 2002 09:08:25 +0100 nipkow added show_main_goal
Wed, 06 Nov 2002 14:02:18 +0100 nipkow Hoare.ML -> hoare.ML
Wed, 06 Nov 2002 14:01:38 +0100 nipkow a new pointer example and some syntactic sugar
Tue, 05 Nov 2002 15:59:17 +0100 kleing two new Bali files
Tue, 05 Nov 2002 15:51:18 +0100 paulson new operator transrec3
Mon, 04 Nov 2002 14:17:00 +0100 berghofe Removed obsolete section about reordering assumptions.
Fri, 01 Nov 2002 17:44:26 +0100 paulson proof streamlining
Fri, 01 Nov 2002 17:43:54 +0100 paulson tidy
Fri, 01 Nov 2002 13:16:28 +0100 schirmer Inserted some extra paragraphs in large proofs to make tex run...
Fri, 01 Nov 2002 10:35:50 +0100 kleing fixed "latex capacity exceeded"
Thu, 31 Oct 2002 18:27:10 +0100 schirmer "Definite Assignment Analysis" included, with proof of correctness. Large adjustments of type safety proof and soundness proof of the axiomatic semantics were necessary. Completeness proof of the loop rule of the axiomatic semantic was altered. So the additional polymorphic variants of some rules could be removed.
Wed, 30 Oct 2002 12:44:18 +0100 paulson simpler separation/replacement proofs
Wed, 30 Oct 2002 12:18:23 +0100 nipkow modified msg
Tue, 29 Oct 2002 11:32:52 +0100 nipkow added induction thms
(0) -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip