Make incremental rewriting more accessible

The existing incremental hom search code is very low level and not yet connected to the rest of AlgebraicRewriting:

0.) Add support for *attributed* C-Sets
1.) handle multiple patterns and multiple states via `IHS([P1,P2],[f1,f2],[G1,G2])`
2.) create from list of rewrite rules via `IHS([r1,r2,...], G)` which should monitor patterns for each of the LHS of the rules
3.) Handle deletion (add a parameter to indicate whether or not deletion is enforced strictly or lazily)[^1].
4.) look into jump diffusion - seems related to batch rewriting. could we support it more natively?
5.) support rules which merge (here the theory needs to be worked out a bit more)
6.) support application conditions

[^1]: Strict means we perform linear scan through all matches after any deletion (there's probably a way of indexing all matches by what part of G they refer to so that we can only loop through the matches that need to be deleting). We've decided that this is necessary for sampling algorithms that need to know how much to advance the clock time in the gillespie algorithm.