|
wenzelm@9928
|
1 |
|
|
wenzelm@9928
|
2 |
Subject: Announcing Isabelle99-1
|
|
wenzelm@9928
|
3 |
To: isabelle-users@cl.cam.ac.uk
|
|
wenzelm@9928
|
4 |
|
|
wenzelm@10161
|
5 |
Isabelle99-1 is now available. This release continues the line of
|
|
wenzelm@10161
|
6 |
Isabelle99, introducing numerous improvements, both internal and user
|
|
wenzelm@10161
|
7 |
visible.
|
|
wenzelm@9928
|
8 |
|
|
wenzelm@10161
|
9 |
In particular, great care has been taken to improve robustness and
|
|
wenzelm@10161
|
10 |
ease use and installation of the complete Isabelle working
|
|
wenzelm@10165
|
11 |
environment. This includes Proof General user interface support, WWW
|
|
wenzelm@10161
|
12 |
presentation of theories and the Isabelle document preparation system.
|
|
wenzelm@9928
|
13 |
|
|
wenzelm@10168
|
14 |
The most prominent highlights of Isabelle99-1 are as follows. See the
|
|
wenzelm@10168
|
15 |
NEWS file distributed with Isabelle for more details.
|
|
wenzelm@9928
|
16 |
|
|
wenzelm@10161
|
17 |
* Isabelle/Isar improvements (Markus Wenzel)
|
|
wenzelm@10161
|
18 |
o Support of tactic-emulation scripts for easy porting of legacy ML
|
|
wenzelm@10161
|
19 |
scripts (see also the HOL/Lambda example).
|
|
wenzelm@10161
|
20 |
o Better support for scalable verification tasks (manage large
|
|
wenzelm@10161
|
21 |
contexts in induction, generalized existence reasoning etc.)
|
|
wenzelm@10161
|
22 |
o Hindley-Milner polymorphism for proof texts.
|
|
wenzelm@10161
|
23 |
o More robust document preparation, better LaTeX output due to
|
|
wenzelm@10161
|
24 |
fake math-mode.
|
|
wenzelm@10166
|
25 |
o Extended "Isabelle/Isar Reference Manual".
|
|
wenzelm@10161
|
26 |
|
|
wenzelm@10166
|
27 |
* HOL/Algebra (Clemens Ballarin)
|
|
wenzelm@10166
|
28 |
Rings and univariate polynomials.
|
|
wenzelm@10161
|
29 |
|
|
wenzelm@10162
|
30 |
* HOL/BCV (Tobias Nipkow)
|
|
wenzelm@10168
|
31 |
Generic model of bytecode verification.
|
|
wenzelm@10162
|
32 |
|
|
wenzelm@10166
|
33 |
* HOL/IMPP (David von Oheimb)
|
|
wenzelm@10168
|
34 |
Extension of IMP with local variables and mutually recursive procedures.
|
|
wenzelm@10161
|
35 |
|
|
wenzelm@10166
|
36 |
* HOL/Isar_examples (Markus Wenzel)
|
|
wenzelm@10166
|
37 |
More examples, including a formulation of Hoare Logic in Isabelle/Isar.
|
|
wenzelm@10161
|
38 |
|
|
wenzelm@10161
|
39 |
* HOL/Lambda (Stefan Berghofer and Tobias Nipkow)
|
|
wenzelm@10168
|
40 |
More on termination of simply-typed lambda-terms (Isar script).
|
|
wenzelm@10161
|
41 |
|
|
wenzelm@10161
|
42 |
* HOL/Lattice (Markus Wenzel)
|
|
wenzelm@10161
|
43 |
Lattices and orders in Isabelle/Isar.
|
|
wenzelm@10161
|
44 |
|
|
wenzelm@10166
|
45 |
* HOL/MicroJava (Gerwin Klein, Tobias Nipkow, David von Oheimb, and
|
|
wenzelm@10166
|
46 |
Cornelia Pusch)
|
|
wenzelm@10166
|
47 |
Formalization of a fragment of Java, together with a corresponding
|
|
wenzelm@10168
|
48 |
virtual machine and a specification of its bytecode verifier.
|
|
wenzelm@10166
|
49 |
|
|
wenzelm@10166
|
50 |
* HOL/NumberTheory (Thomas Rasmussen)
|
|
wenzelm@10166
|
51 |
Fundamental Theorem of Arithmetic, Chinese Remainder Theorem,
|
|
wenzelm@10166
|
52 |
Fermat/Euler Theorem, Wilson's Theorem.
|
|
wenzelm@10166
|
53 |
|
|
wenzelm@10161
|
54 |
* HOL/Prolog (David von Oheimb)
|
|
wenzelm@10161
|
55 |
A (bare-bones) implementation of Lambda-Prolog.
|
|
wenzelm@9928
|
56 |
|
|
wenzelm@10167
|
57 |
* HOL/Real (Jacques Fleuriot)
|
|
wenzelm@10167
|
58 |
More on nonstandard real analysis.
|
|
wenzelm@10166
|
59 |
|
|
wenzelm@9928
|
60 |
You may get Isabelle99-1 from any of the following mirror sites:
|
|
wenzelm@9928
|
61 |
|
|
wenzelm@9928
|
62 |
Cambridge (UK) http://www.cl.cam.ac.uk/Research/HVG/Isabelle/dist/
|
|
wenzelm@9928
|
63 |
Munich (Germany) http://isabelle.in.tum.de/dist/
|
|
wenzelm@10161
|
64 |
New Jersey (USA) ftp://ftp.research.bell-labs.com/dist/smlnj/isabelle/index.html
|
|
wenzelm@10161
|
65 |
Stanford (USA) ftp://rodin.stanford.edu/pub/smlnj/isabelle/index.html
|