isabelle: Changelog

Mercurial Mercurial > repos > isabelle / changelog

summary | shortlog | changelog | graph | tags | bookmarks | branches | files | gz | help
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip

Wed, 06 Nov 2002 14:02:18 +0100 Hoare.ML -> hoare.ML

nipkow [Wed, 06 Nov 2002 14:02:18 +0100] rev 13697

Hoare.ML -> hoare.ML

Wed, 06 Nov 2002 14:01:38 +0100 a new pointer example and some syntactic sugar

nipkow [Wed, 06 Nov 2002 14:01:38 +0100] rev 13696

a new pointer example and some syntactic sugar

Tue, 05 Nov 2002 15:59:17 +0100 two new Bali files

kleing [Tue, 05 Nov 2002 15:59:17 +0100] rev 13695

two new Bali files

Tue, 05 Nov 2002 15:51:18 +0100 new operator transrec3

paulson [Tue, 05 Nov 2002 15:51:18 +0100] rev 13694

new operator transrec3

Mon, 04 Nov 2002 14:17:00 +0100 Removed obsolete section about reordering assumptions.

berghofe [Mon, 04 Nov 2002 14:17:00 +0100] rev 13693

Removed obsolete section about reordering assumptions.

Fri, 01 Nov 2002 17:44:26 +0100 proof streamlining

paulson [Fri, 01 Nov 2002 17:44:26 +0100] rev 13692

proof streamlining

Fri, 01 Nov 2002 17:43:54 +0100 tidy

paulson [Fri, 01 Nov 2002 17:43:54 +0100] rev 13691

tidy

Fri, 01 Nov 2002 13:16:28 +0100 Inserted some extra paragraphs in large proofs to make tex run...

schirmer [Fri, 01 Nov 2002 13:16:28 +0100] rev 13690

Inserted some extra paragraphs in large proofs to make tex run...

Fri, 01 Nov 2002 10:35:50 +0100 fixed "latex capacity exceeded"

kleing [Fri, 01 Nov 2002 10:35:50 +0100] rev 13689

fixed "latex capacity exceeded"

Thu, 31 Oct 2002 18:27:10 +0100 "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.

schirmer [Thu, 31 Oct 2002 18:27:10 +0100] rev 13688

"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.

(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip

isabelle