Re: [m-users.] Compiler cannot infer determinism det when exhaustively pattern matching on a constant?

For whatever it is worth, another workaround (turning the constant
into a constant function):

:- module test.
:- interface.
:- type t ---> c1; c2.
:- pred p(t::out) is det.
:- implementation.
:- func c(t) = t.
c(_) = c1.
p(A) :- c(c1) = C, ((C = c1, A = c2) ; (C = c2, A = c1)).
_______________________________________________
users mailing list
[email protected]
https://lists.mercurylang.org/listinfo/users