Hello,
On 4/13/06, Ross Paterson [EMAIL PROTECTED] wrote:
They are equivalent, but C [a] b d, Num c and C [a] c d, Num c are not.
I agree that this is the case if you are thinking of
forall a b c d. (C [a] b d, Num c) = (C [a] c d, Num c)
Here is a counter example (assume we also add an
| there are interesting problems in FDs, but it seems that the
confluence
| problems were merely problems of the old translation, not anything
| inherent in FDs! I really had hoped we had put that phantom to rest.
Claus
You're doing a lot of work here, which is great. Why not write a paper?
Hello,
On 4/12/06, Claus Reinke [EMAIL PROTECTED] wrote:
that's why Ross chose a fresh variable in FD range position:
in the old translation, the class-based FD improvement rule no
longer applies after reduction because there's only one C constraint
left, and the instance-based FD improvement
On Thu, Apr 13, 2006 at 12:07:53PM -0700, Iavor Diatchki wrote:
On 4/12/06, Claus Reinke [EMAIL PROTECTED] wrote:
that's why Ross chose a fresh variable in FD range position:
in the old translation, the class-based FD improvement rule no
longer applies after reduction because there's only
On Thu, Apr 13, 2006 at 05:10:36PM -0700, Iavor Diatchki wrote:
I understand the reduction steps. Are you saying that the problem is
that the two sets are not syntactically equal? To me this does not
seem important: we just end up with two different ways to say the same
thing (i.e.,
On Mon, Apr 10, 2006 at 02:39:18PM +0100, Claus Reinke wrote:
class B a b | a - b
class C a b c | a - b
instance B a b = C [a] b Bool
Starting from a constraint set C [a] b Bool, C [a] c d, [...]
CHR-alt:
B a b = infer_B a b, memo_B a b.
memo_B a b1, memo_B a b2 ==b1=b2.
C a b c = infer_C
On Mon, Apr 10, 2006 at 06:48:35PM +0100, Claus Reinke wrote:
note also that we are talking about different things here: I am talking
about FD consistency, you are talking about the FD consistency condition.
That would explain a few things.
as this example shows once again, there are
On Mon, Apr 10, 2006 at 02:39:18PM +0100, Claus Reinke wrote:
instance B a b = C [a] b Bool
Starting from a constraint set C [a] b Bool, C [a] c d,
there is no implication that d=Bool
(you could add: 'instance B a b = C [a] b Char' without violating
FD consistency).
These instances
Interesting! It'd be great if you've found a simpler more uniform rule.
(Which you seem to be getting rather good at.)Let's see if you can
convince Martin, first, and then articulate the proposed rules. I'll
look fwd to that.
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
