Mon, 24 May 2010 13:48:57 +0200 haftmann more lemmas
Mon, 24 May 2010 13:48:56 +0200 haftmann induction and case rules
Mon, 24 May 2010 10:48:32 +0200 ballarin Store registrations in efficient data structure.
Mon, 24 May 2010 10:48:32 +0200 ballarin Avoid recomputation of registration instance for lookup.
Mon, 24 May 2010 10:48:32 +0200 ballarin Consistently use equality for registration lookup.
Mon, 24 May 2010 10:48:32 +0200 ballarin Cleaner implementation of sublocale command.
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip