[isabelle-dev] NEWS

2008-12-03 Thread Gerwin Klein
Makarius wrote:
 Of course, heaps produced inside the repository file space like that must 
 not be committed.

We might want to add an .hgignore file and put ^heaps/ in it. This should at 
least make accidental commits less likely.

Gerwin


[isabelle-dev] NEWS

2008-12-03 Thread Gerwin Klein
Makarius wrote:
 It is already there, together with some other things that people tend to 
 commit by accident:

Too fast for me ;-)

Gerwin


[isabelle-dev] Isabelle on Mercurial

2008-12-03 Thread Gerwin Klein
Tjark Weber wrote:
 On Tue, 2008-12-02 at 22:09 +0100, Makarius wrote:
 With Mercurial you have the whole history always around, and there is no 
 need to encode (tiny) parts of it in the file.
 
 Certainly $Id$ keys are rather useless as long as the file is part of a
 managed repository.  However, files escape into the wild.

I'm no great friend of $Id$, but Tjark does have a point: we release 
development snapshots and it is very easy to confuse versions when people ask 
questions about specific files etc.

Maybe a good point to add version info to files/do keyword substitution would 
be makedist? I haven't checked the hg extension in detail, but it might be 
possible to enable it only for export (archive), not for regular repository 
traffic.

Gerwin


[isabelle-dev] Numeral simplification: neg and iszero

2008-12-03 Thread Tobias Nipkow
They have been on my get-rid-of list for some time, but when I initially
tried, I noticed they were needed for doing arithmetic. Now that
somebody (Florian?) added less_int_code, it may indeed be a simple job.
Go for it!

Tobias

Brian Huffman schrieb:
 Is there any good reason why the constants neg and iszero (defined
 in Int.thy) are needed anymore?
 
 Currently they are used to simplify (in)equalities on numerals; for
 example, number_of x  number_of y rewrites to neg (x + - y).
 However, Int.thy also provides separate sets of rules like this:
 
 lemma less_int_code [code]:
   Int.Pls  Int.Pls \longleftrightarrow False
   Int.Pls  Int.Min \longleftrightarrow False
   Int.Pls  Int.Bit0 k \longleftrightarrow Int.Pls  k
   Int.Pls  Int.Bit1 k \longleftrightarrow Int.Pls \le k
   Int.Min  Int.Pls \longleftrightarrow True
   Int.Min  Int.Min \longleftrightarrow False
   Int.Min  Int.Bit0 k \longleftrightarrow Int.Min  k
   Int.Min  Int.Bit1 k \longleftrightarrow Int.Min  k
   Int.Bit0 k  Int.Pls \longleftrightarrow k  Int.Pls
   Int.Bit1 k  Int.Pls \longleftrightarrow k  Int.Pls
   Int.Bit0 k  Int.Min \longleftrightarrow k \le Int.Min
   Int.Bit1 k  Int.Min \longleftrightarrow k  Int.Min
   Int.Bit0 k1  Int.Bit0 k2 \longleftrightarrow k1  k2
   Int.Bit0 k1  Int.Bit1 k2 \longleftrightarrow k1 \le k2
   Int.Bit1 k1  Int.Bit0 k2 \longleftrightarrow k1  k2
   Int.Bit1 k1  Int.Bit1 k2 \longleftrightarrow k1  k2
 
 These are declared with the [code] attribute; wouldn't they also work
 just as well as simp rules? It seems that the old rewrite strategy using
 neg and iszero was designed to minimize the total number of rewrite
 rules in the simp set; I'm not sure whether this was done for
 performance reasons, or just for the fact that it was easier to
 implement, because there were fewer lemmas to prove.
 
 I would propose that we change the simplification strategy for
 (in)equalities on numerals to use the code lemmas instead, and
 completely get rid of neg and iszero. I think the code lemmas are
 cleaner and easier to understand, and they will also make the transition
 to unsigned numerals easier (since we no longer need to rely on
 subtraction to do comparisons).
 
 - Brian
 
 
 
 ___
 Isabelle-dev mailing list
 Isabelle-dev at mailbroy.informatik.tu-muenchen.de
 https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/isabelle-dev


[isabelle-dev] Numeral simplification: neg and iszero

2008-12-03 Thread Florian Haftmann
Hi Brian,

 Is there any good reason why the constants neg and iszero (defined
 in Int.thy) are needed anymore?

if there is a chance to get rid of those, go ahead and try.  Perhaps
they play a role for numerals and natural numbers, but this is just a
suspicion.

Cheers
Florian

-- 

Home:
http://wwwbroy.in.tum.de/~haftmann

PGP available:
http://home.informatik.tu-muenchen.de/haftmann/pgp/florian_haftmann_at_informatik_tu_muenchen_de

-- next part --
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 252 bytes
Desc: OpenPGP digital signature
URL: 
https://mailmanbroy.informatik.tu-muenchen.de/pipermail/isabelle-dev/attachments/20081203/850e8800/attachment.pgp