Revision as of 09:26, 11 January 2010

Change Proposals to Version 1.0

Matthias: Section 2.3 says that integer literals are unsigned, i.e., nonnegative. In Arithmetic Rewrite Rules, it is assumed that integer literals may also be negative. I therefore propose to say in Section 2.3 that integer literals can be positive, zero, or negative, but that negative literals such as -1 are parsed to unary minus followed by 1.

@@ Line 1: / Line 1: @@
-==Purpose==
+=Change Proposals to Version 1.0=
-The Proof Skeleton View gives the user the ability to quickly browse the skeleton of a proof, without having to prove it anew. Furthermore, it is intended to be a convenient way to display rules and sequents together in the same view.
+* Matthias: Section 2.3 says that integer literals are unsigned, i.e., nonnegative. In [[Arithmetic Rewrite Rules]], it is assumed that integer literals may also be negative. I therefore propose to say in Section 2.3 that integer literals can be positive, zero, or negative, but that negative literals such as -1 are parsed to unary minus followed by 1.
-==The Proof Skeleton View==
-===Showing the View===
-The Proof Skeleton View is available as other views in the
-Window > Show View > Other > Event-B > Proof Skeleton View
-menu.
-To watch a proof skeleton, simply select a proved predicate in the obligation explorer, or a proof file in the editor.
-===View Interpretation===
-Proof skeletons are displayed in a two-part view. On the left hand side is the tree structure of rules applied in the proof. On the other side stands the sequent on which the currently selected rule is applied.
-[[Image:proofSkeletonView.jpg]]
-The tree can be expanded or collapsed by using [+] and [-] buttons on the upper right corner.