[Haskell-cafe] How to implement `amb' operator?

[Bayley, Alistair]

Not wanting to appear glib, but...
  SICP  4.3.3  Implementing the Amb Evaluator
  http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-28.html#%_sec_4.3.3

  Ralf Hinze (2000): Deriving Backtracking Monad Transformers
  http://www.informatik.uni-bonn.de/~ralf/publications.html#P12


> -----Original Message-----
> From: Meihui Fan [mailto:mhfan at ustc.edu]
> Sent: 07 April 2004 21:20
> To: haskell-cafe at haskell.org
> Subject: [Haskell-cafe] How to implement `amb' operator?
> 
> 
> Hi,
>   I think it's good idea to compute non-deterministic 
> problems with the `amb'
> operator, just as in LISP/scheme. But how to implement it in haskell?
> 
> noclouds

-----------------------------------------
*****************************************************************
Confidentiality Note: The information contained in this 
message, and any attachments, may contain confidential 
and/or privileged material. It is intended solely for the 
person(s) or entity to which it is addressed. Any review, 
retransmission, dissemination, or taking of any action in 
reliance upon this information by persons or entities other 
than the intended recipient(s) is prohibited. If you received
this in error, please contact the sender and delete the 
material from any computer.
*****************************************************************