How does Curry manage ambiguity in non-deterministic computations—especially when multiple valid instantiations exist for a free variable?
Probably like Prolog, we get to generate all possible variations.