Hi Sebastian,
Sebastian Hanowski <seha_at_informatik.uni-kiel.de> writes:
> looks like you're essentially aiming at a monadic semantics of
> non-determnism.
> The above equation could also be formulated like this
>
> [(x,x) | x <- coin] == uncurry zip (coin,coin)
>
> However, using the list monad to model non-determnism seems to have
> never been appreciated much by the FLP community because disjunction
> realized as concatenation is biased.
Right. Could you provide me more details about what do you think the
bias is?
Anyways, we don't need to use the list monad, we can use a lot of
different monads modeling non-determinism.
By the way, I'm not very confident that using monads is the way to,
but I want to play with them nevertheless, to see what kind of Curry
one get. I know of some papers who have attempted this, and certainly
the result was cool.
Thanks for your comments,
Emilio
_______________________________________________
curry mailing list
curry_at_lists.RWTH-Aachen.DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry
Received on Mi Apr 11 2007 - 11:56:25 CEST