lcp [Thu, 06 Apr 1995 10:55:06 +0200] rev 1000
Now sets loadpath.
lcp [Thu, 06 Apr 1995 10:53:21 +0200] rev 999
Gave tighter priorities to SUM and PROD to reduce ambiguities.
lcp [Thu, 06 Apr 1995 10:51:42 +0200] rev 998
Gave tighter priorities to if, napply and the let-forms to
reduce ambiguities.
lcp [Thu, 06 Apr 1995 10:49:53 +0200] rev 997
Now sets eta_contract.
lcp [Thu, 06 Apr 1995 10:48:11 +0200] rev 996
Added Id: line
nipkow [Sun, 02 Apr 1995 10:43:59 +0200] rev 995
generalized map (%x.x) xs = xs to map (%x.x) = (%xs.xs)
wenzelm [Fri, 31 Mar 1995 15:08:49 +0200] rev 994
replaced 'arities' by 'instance';
lcp [Fri, 31 Mar 1995 12:22:16 +0200] rev 993
Simplified using pattern replacements. Added the AC example.
lcp [Fri, 31 Mar 1995 11:55:29 +0200] rev 992
New example of AC Equivalences by Krzysztof Grabczewski
lcp [Fri, 31 Mar 1995 11:39:47 +0200] rev 991
New example of AC Equivalences by Krzysztof Grabczewski
lcp [Fri, 31 Mar 1995 11:08:35 +0200] rev 990
Tried the new addss in many proofs, and tidied others involving simplification.
lcp [Fri, 31 Mar 1995 10:58:14 +0200] rev 989
Tried the new addss in a proof.
lcp [Fri, 31 Mar 1995 02:00:29 +0200] rev 988
Defined addss to perform simplification in a claset.
Precedence of addcongs is now 4 (to match that of other simplifier infixes)
clasohm [Thu, 30 Mar 1995 14:07:52 +0200] rev 987
changed translation of _applC
clasohm [Thu, 30 Mar 1995 14:07:30 +0200] rev 986
changed pretty printing of applC
lcp [Thu, 30 Mar 1995 14:01:35 +0200] rev 985
Added comment about why mem_irrefl should not be a safeE.
lcp [Thu, 30 Mar 1995 13:54:41 +0200] rev 984
Tried the new addss in many proofs, and tidied others
involving simplification.
lcp [Thu, 30 Mar 1995 13:48:30 +0200] rev 983
Precedence of infixes is now 4 (just above that of :=)
lcp [Thu, 30 Mar 1995 13:44:34 +0200] rev 982
Addition of wrappers for integration with the simplifier.
New infixes setwrapper compwrapper addbefore addafter. New function
getwrapper. The wrapper is a tactical that is applied to the step tactic. By
default it is the identity. Using THEN one can cause other tactics to be
tried before or after the step tactic. Other effects are possible using
ORELSE, etc.
lcp [Thu, 30 Mar 1995 13:36:00 +0200] rev 981
Defined addss to perform simplification in a claset.
Precedence of addcongs is now 4 (to match that of other simplifier infixes)
clasohm [Thu, 30 Mar 1995 13:07:59 +0200] rev 980
removed unnecessary parentheses from the generated rules
nipkow [Thu, 30 Mar 1995 08:54:17 +0200] rev 979
Simplification: used Logic.occs instead of mem add_term_frees
clasohm [Tue, 28 Mar 1995 13:13:17 +0200] rev 978
changed string scanner so that newlines ('\n') are allowed and ignored inside
strings
clasohm [Tue, 28 Mar 1995 12:25:20 +0200] rev 977
changed syntax of datatype declarations (curried types for constructor
parameters)
clasohm [Tue, 28 Mar 1995 12:21:10 +0200] rev 976
renamed theorem "apfst" to "apfst_conv" to avoid conflict with function
apfst from Pure/library.ML
lcp [Tue, 28 Mar 1995 10:24:45 +0200] rev 975
Corrected faulty reference to Hindley-Milner type inference
nipkow [Mon, 27 Mar 1995 18:29:23 +0200] rev 974
Added recursion equations for foldl to list_ss.
nipkow [Sun, 26 Mar 1995 17:04:45 +0200] rev 973
Modified If_def to avoid ambiguity.
clasohm [Fri, 24 Mar 1995 12:30:35 +0100] rev 972
changed syntax of tuples from <..., ...> to (..., ...)
clasohm [Thu, 23 Mar 1995 15:39:13 +0100] rev 971
fixed bug: parent theory wasn't loaded if .thy file was completly read before
(regardless of the .ML file)