Yiliang Liang
Yiliang Liang
This sounds really interesting and reasonable! Informations such as `match_count` and `match_id` are what we can attach to our `Subst[]` object and individual `Subst` objects. I think it would be...
For now I’ll require everything matched to be distinct, and introduce the special Style predicate Ordered(...) (that takes a variable number of arguments). For instance, ``` forall Thing t1, t2,...
Yup, I think so.
It's just that the predicate form for Ordered(a, b) integrates well with how we prevent double-matching.
Upon discussions from yesterday, we are _temporarily_ leaving this aside until we find specific examples where this would be useful.
Just to clarify, say we have an `exists` block. We want this to be matched and triggered _at most once_, right? @keenancrane
The distinction between _permutation_ and _combination_ seems a lot like the distinction between _ordered_ and _unordered_ matching. Our current methodology performs _combination_ matching. If it sees _(a, b) => (A,...
Hmmm ... I think this might break the general algorithm behind the _faster matching semantics_ which requires the predicates to all hold ... we'll have to think more about this
Seems like an overflow with the optimizer, not the style matcher.
