On 08-Apr-2001, Terrence Brannon <[EMAIL PROTECTED]> wrote:
>
> I have decided to escape the world of Perl into something more
> definitional. I gave up on CAML and Erlang because they contain
> imperative elements and I am tired of that form of coding. So, I have
> narrowed it down to Haskell an
On Tue, Apr 10, 2001 at 11:16:27AM +1000, Manuel M. T. Chakravarty wrote:
> I always knew that inside Haskell there is a Perl trying to
> get out!
import List;q _ _ 0 _=[[]];q u i r k=let{b=[x+1|x<-u,-1>x||x>0,x[p:x|x<-q(-p:p:b)(i\\[p])(r-1)k])d;main=print$q[][1..8]8 8
(158 chars, but the output
[EMAIL PROTECTED] (Marcin 'Qrczak' Kowalczyk) wrote,
> Mon, 9 Apr 2001 14:30:01 +1000, Fergus Henderson <[EMAIL PROTECTED]> pisze:
>
> > For an example of this, I've attached a program for solving the
> > 8-queens problem;
>
> Here is mine, also using the list monad together with the state mona
Several people, including myself in my long forgotten thesis, have shown
that these are equivalent.
Erik
- Original Message -
From: "Jerzy Karczmarczuk" <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>
Sent: Monday, April 09, 2001 5:08 AM
Subject: Backtracking (Was: W
Mon, 9 Apr 2001 14:30:01 +1000, Fergus Henderson <[EMAIL PROTECTED]> pisze:
> For an example of this, I've attached a program for solving the
> 8-queens problem;
Here is mine, also using the list monad together with the state monad
(uses StateT [] and not ListT State, so the state is restored du
On 09-Apr-2001, Jerzy Karczmarczuk <[EMAIL PROTECTED]> wrote:
> Fergus Henderson wrote:
> > The usual way of handling backtracking in Haskell is using lazy lists.
...
> This is a way to deal with *data backtracking*. Sure, most of
> classical combinatoric algorithms belong to this category, the g
Fergus Henderson wrote:
> On 08-Apr-2001, Terrence Brannon wrote:
> >
> > 1- Haskell is a pure functional language, but I don't see any support
> > for backtracking or other logic features... but my guess is you have
> > some way of handling this? How?
>
> The usual way of handling backtracking
On 08-Apr-2001, Terrence Brannon <[EMAIL PROTECTED]> wrote:
>
> 1- Haskell is a pure functional language, but I don't see any support
> for backtracking or other logic features... but my guess is you have
> some way of handling this? How?
The usual way of handling backtracking in Haskell is usin
I have decided to escape the world of Perl into something more
definitional. I gave up on CAML and Erlang because they contain
imperative elements and I am tired of that form of coding. So, I have
narrowed it down to Haskell and Mercury.
The attractive things about Haskell are:
- automatic gener
