Use different module structuring of uPred.
This fixes the following issue by JH Jourdan: The fact of including uPred_[...] in the module uPred (in base_logic.v), implies that typeclasses instances are declared twice. Once in module uPred and once in module uPred_[...]. This has the unfortunate consequence that it has to backtrack to both instances each time the first one fails, making failure of type class search for e.g. PersistentP potentially exponential. Goal ((□ ∀ (x1 x2 x3 x4 x5: nat), True -∗ True) -∗ True : iProp Σ). Time iIntros "#H". Undo. Remove Hints uPred_derived.forall_persistent : typeclass_instances. Time iIntros "#H". Thanks to Jason Gross @ Coq club for suggesting this fix.
Showing
- theories/base_logic/base_logic.v 4 additions, 5 deletionstheories/base_logic/base_logic.v
- theories/base_logic/derived.v 3 additions, 4 deletionstheories/base_logic/derived.v
- theories/base_logic/double_negation.v 0 additions, 1 deletiontheories/base_logic/double_negation.v
- theories/base_logic/lib/fractional.v 1 addition, 1 deletiontheories/base_logic/lib/fractional.v
- theories/base_logic/primitive.v 2 additions, 2 deletionstheories/base_logic/primitive.v
- theories/base_logic/soundness.v 2 additions, 2 deletionstheories/base_logic/soundness.v
- theories/base_logic/upred.v 2 additions, 2 deletionstheories/base_logic/upred.v
Loading
Please register or sign in to comment