Thu, 16 Jan 2025 10:09:42 +0000 merged
paulson [Thu, 16 Jan 2025 10:09:42 +0000] rev 81817
merged
Thu, 16 Jan 2025 10:09:33 +0000 More tidying of old proofs
paulson <lp15@cam.ac.uk> [Thu, 16 Jan 2025 10:09:33 +0000] rev 81816
More tidying of old proofs
Thu, 16 Jan 2025 09:26:58 +0100 dropped redundant material (left-over from 5e3dd01a9eb2)
haftmann [Thu, 16 Jan 2025 09:26:58 +0100] rev 81815
dropped redundant material (left-over from 5e3dd01a9eb2)
Thu, 16 Jan 2025 09:26:57 +0100 explicit check for (experimentally determined) border value
haftmann [Thu, 16 Jan 2025 09:26:57 +0100] rev 81814
explicit check for (experimentally determined) border value
Thu, 16 Jan 2025 09:26:56 +0100 theory to rewrite arithmetic operations to bit shifts
haftmann [Thu, 16 Jan 2025 09:26:56 +0100] rev 81813
theory to rewrite arithmetic operations to bit shifts
Wed, 15 Jan 2025 17:48:38 +0100 merge
nipkow [Wed, 15 Jan 2025 17:48:38 +0100] rev 81812
merge
Wed, 15 Jan 2025 16:45:12 +0100 Compact notation for Suc numerals.
nipkow [Wed, 15 Jan 2025 16:45:12 +0100] rev 81811
Compact notation for Suc numerals.
Wed, 15 Jan 2025 13:55:58 +0100 store the {l,g}fp-definition and the monotonicity theorem for inductive predicates (by Jan van Brügge)
traytel [Wed, 15 Jan 2025 13:55:58 +0100] rev 81810
store the {l,g}fp-definition and the monotonicity theorem for inductive predicates (by Jan van Brügge)
Wed, 15 Jan 2025 13:54:28 +0100 make the definition of BNF bounds more easily accessible (by Jan van Brügge)
traytel [Wed, 15 Jan 2025 13:54:28 +0100] rev 81809
make the definition of BNF bounds more easily accessible (by Jan van Brügge)
Wed, 15 Jan 2025 13:53:25 +0100 avoid theorem name clash (by Jan van Brügge)
traytel [Wed, 15 Jan 2025 13:53:25 +0100] rev 81808
avoid theorem name clash (by Jan van Brügge)
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 tip