Sat, 22 Apr 1995 12:21:41 +0200 I have modified the grammar for idts (sequences of identifiers with optional
nipkow [Sat, 22 Apr 1995 12:21:41 +0200] rev 1067
I have modified the grammar for idts (sequences of identifiers with optional type annotations). idts are generally used as in abstractions, be it lambda-abstraction or quantifiers. It now has roughly the form idts = pttrn* pttrn = idt where pttrn is a new nonterminal (type) not used anywhere else. This means that the Pure syntax for idts is in fact unchanged. The point is that the new nontermianl pttrn allows later extensions of this syntax. (See, for example, HOL/Prod.thy). The name idts is not quite accurate any longer and may become downright confusing once pttrn has been extended. Something should be done about this, in particular wrt to the manual.
Wed, 19 Apr 1995 19:15:29 +0200 Simplified proofs thanks to addss.
nipkow [Wed, 19 Apr 1995 19:15:29 +0200] rev 1066
Simplified proofs thanks to addss.
(0) -1000 -300 -100 -30 -10 -2 +2 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip