Thank you for all of the responses! The amb package is something like what I
want; though, as aforementioned, the right and left rules won't return the
same proof and so we can't really use it here.
I've been thinking about this problem generally, not just in the Haskell
setting. It makes sense
\a b - Left a `amb` Right b
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Jamie Morgenstern
Sent: 21 December 2009 16:50
To: Benedikt Huber
Cc: haskell-cafe@haskell.org
Subject: [Haskell-cafe] Re: no sparks?
Thank
On Sun, 2009-12-20 at 17:25 -0500, Jamie Morgenstern wrote:
Hello;
I am writing a parallel theorem prover using Haskell, and I am trying
to do several things. As a first cut, I want to try using the par
construct
to attempt right and left rules simultaneously, and to evaluate both
I did compile with -threaded.
On Sun, Dec 20, 2009 at 5:42 PM, Maciej Piechotka uzytkown...@gmail.comwrote:
On Sun, 2009-12-20 at 17:25 -0500, Jamie Morgenstern wrote:
Hello;
I am writing a parallel theorem prover using Haskell, and I am trying
to do several things. As a first
On Dec 20, 2009, at 17:42 , Maciej Piechotka wrote:
-threaded?
RTS wouldn't accept -N2 if it weren't compiled threaded.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allb...@kf8nh.com
system administrator [openafs,heimdal,too many hats] allb...@ece.cmu.edu
electrical and computer
Felipe Lessa schrieb:
On Mon, Dec 21, 2009 at 12:39:06AM +0100, Daniel Fischer wrote:
Am Sonntag 20 Dezember 2009 23:25:02 schrieb Jamie Morgenstern:
Also, I was wondering if something akin to a parallel or exists. By this,
I mean I am looking for a function which, given x : a , y : a, returns
Daniel Fischer schrieb:
Am Sonntag 20 Dezember 2009 23:25:02 schrieb Jamie Morgenstern:
Hello;
Also, I was wondering if something akin to a parallel or exists. By this,
I mean I am looking for a function which, given x : a , y : a, returns
either, whichever computation returns first.
This
