Fri, 02 Mar 2007 15:43:24 +0100 simplified code generator setup
haftmann [Fri, 02 Mar 2007 15:43:24 +0100] rev 22393
simplified code generator setup
Fri, 02 Mar 2007 15:43:23 +0100 tuned code theorems
haftmann [Fri, 02 Mar 2007 15:43:23 +0100] rev 22392
tuned code theorems
Fri, 02 Mar 2007 15:43:22 +0100 added add_numerals_of
haftmann [Fri, 02 Mar 2007 15:43:22 +0100] rev 22391
added add_numerals_of
Fri, 02 Mar 2007 15:43:21 +0100 now using "class"
haftmann [Fri, 02 Mar 2007 15:43:21 +0100] rev 22390
now using "class"
Fri, 02 Mar 2007 15:43:20 +0100 using "fst" "snd" for Haskell code
haftmann [Fri, 02 Mar 2007 15:43:20 +0100] rev 22389
using "fst" "snd" for Haskell code
Fri, 02 Mar 2007 15:43:19 +0100 added code theorems for UNIV
haftmann [Fri, 02 Mar 2007 15:43:19 +0100] rev 22388
added code theorems for UNIV
Fri, 02 Mar 2007 15:43:18 +0100 adjusted to latest changes
haftmann [Fri, 02 Mar 2007 15:43:18 +0100] rev 22387
adjusted to latest changes
Fri, 02 Mar 2007 15:43:17 +0100 new code theorems
haftmann [Fri, 02 Mar 2007 15:43:17 +0100] rev 22386
new code theorems
Fri, 02 Mar 2007 15:43:16 +0100 syntax for "class attach const"
haftmann [Fri, 02 Mar 2007 15:43:16 +0100] rev 22385
syntax for "class attach const"
Fri, 02 Mar 2007 15:43:15 +0100 prefix of class interpretation not mandatory any longer
haftmann [Fri, 02 Mar 2007 15:43:15 +0100] rev 22384
prefix of class interpretation not mandatory any longer
Fri, 02 Mar 2007 12:38:58 +0100 Meson.is_fol_term now takes a theory as argument. Minor tidying.
paulson [Fri, 02 Mar 2007 12:38:58 +0100] rev 22383
Meson.is_fol_term now takes a theory as argument. Minor tidying.
Fri, 02 Mar 2007 12:37:34 +0100 New code to store theorem names in a concise form rather than as fully-qualified.
paulson [Fri, 02 Mar 2007 12:37:34 +0100] rev 22382
New code to store theorem names in a concise form rather than as fully-qualified. Meson.is_fol_term now takes a theory as argument.
Fri, 02 Mar 2007 12:35:20 +0100 The first-order test now tests for the obscure case of a polymorphic constant like 1 being
paulson [Fri, 02 Mar 2007 12:35:20 +0100] rev 22381
The first-order test now tests for the obscure case of a polymorphic constant like 1 being used with a function type.
Wed, 28 Feb 2007 22:05:46 +0100 abbrev: be permissive after transformation;
wenzelm [Wed, 28 Feb 2007 22:05:46 +0100] rev 22380
abbrev: be permissive after transformation;
Wed, 28 Feb 2007 22:05:44 +0100 exported get_ss, map_ss;
wenzelm [Wed, 28 Feb 2007 22:05:44 +0100] rev 22379
exported get_ss, map_ss;
(0) -10000 -3000 -1000 -300 -100 -15 +15 +100 +300 +1000 +3000 +10000 +30000 tip