Wed, 01 Jun 2011 10:29:43 +0200 tuned names
blanchet [Wed, 01 Jun 2011 10:29:43 +0200] rev 43128
tuned names
Wed, 01 Jun 2011 10:29:43 +0200 export one more function
blanchet [Wed, 01 Jun 2011 10:29:43 +0200] rev 43127
export one more function
Wed, 01 Jun 2011 10:29:43 +0200 clausify "<=>" (needed for some type information)
blanchet [Wed, 01 Jun 2011 10:29:43 +0200] rev 43126
clausify "<=>" (needed for some type information)
Wed, 01 Jun 2011 10:29:43 +0200 distinguish different kinds of typing informations in the fact name
blanchet [Wed, 01 Jun 2011 10:29:43 +0200] rev 43125
distinguish different kinds of typing informations in the fact name
Wed, 01 Jun 2011 09:10:13 +0200 splitting RBT theory into RBT and RBT_Mapping
bulwahn [Wed, 01 Jun 2011 09:10:13 +0200] rev 43124
splitting RBT theory into RBT and RBT_Mapping
Wed, 01 Jun 2011 08:07:28 +0200 creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
bulwahn [Wed, 01 Jun 2011 08:07:28 +0200] rev 43123
creating a free variable with proper name and local mixfix syntax (cf. db9b9e46131c)
Wed, 01 Jun 2011 08:07:27 +0200 code preprocessor applies simplifier when schematic variables are fixed to free variables to allow rewriting with congruence rules in the preprocessing steps
bulwahn [Wed, 01 Jun 2011 08:07:27 +0200] rev 43122
code preprocessor applies simplifier when schematic variables are fixed to free variables to allow rewriting with congruence rules in the preprocessing steps
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip