src/HOL/Imperative_HOL/Ref.thy
Tue, 13 Jul 2010 16:12:40 +0200 haftmann canonical argument order for get
Tue, 13 Jul 2010 16:00:56 +0200 haftmann qualified names for (almost) all array operations
Tue, 13 Jul 2010 15:37:31 +0200 haftmann canonical argument order for present
Tue, 13 Jul 2010 15:34:02 +0200 haftmann canonical argument order for length
Tue, 13 Jul 2010 12:05:20 +0200 haftmann merged
Tue, 13 Jul 2010 12:01:34 +0200 haftmann hide_const; update replaces change
Tue, 13 Jul 2010 12:00:11 +0200 krauss Heap_Monad uses Monad_Syntax
Tue, 13 Jul 2010 11:38:03 +0200 haftmann theorem collections do not contain default rules any longer
Mon, 12 Jul 2010 16:05:08 +0200 haftmann spelt out relational framework in a consistent way
Fri, 09 Jul 2010 16:58:44 +0200 haftmann pervasive success combinator
Fri, 09 Jul 2010 09:48:53 +0200 haftmann tuned reference theory
Tue, 06 Jul 2010 09:21:15 +0200 haftmann refactored reference operations
Mon, 05 Jul 2010 16:46:23 +0200 haftmann moved "open" operations from Heap.thy to Array.thy and Ref.thy
Mon, 05 Jul 2010 14:34:28 +0200 haftmann simplified representation of monad type
Fri, 16 Apr 2010 21:28:09 +0200 wenzelm replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact' -- frees some popular keywords;
Thu, 10 Dec 2009 11:58:26 +0100 bulwahn added Imperative_HOL examples; added tail-recursive combinator for monadic heap functions; adopted code generation of references; added lemmas
Tue, 03 Feb 2009 19:37:00 +0100 haftmann changed name space policy for Haskell includes
Thu, 08 Jan 2009 17:10:41 +0100 haftmann split of Imperative_HOL theories from HOL-Library
less more (0) tip