Hello,
I know very little about licensing, so I'm hoping to get some advice from you
guys.
In the next release of Wired, I plan to include an open-source standard cell
library (or rather data derived from it). This cell library has a custom license
(found at the bottom of http://www.nangate.c
It seems the following pure functional (except for the final printout)
version of the search has almost the same performance as the Dan
Doel's latest version with the unboxed arrays and callCC. For the board of
size 40, Dan Doel's version takes 0.047s on my computer; the version
below takes 0.048s
dan.doel:
> Here's a clean-up of my code (it even fits within the line-length limit of my
> mail client :)). Note that it's pretty much exactly the Python algorithm.
> When
> the Python program finds a solution, it prints the board and exits. Since
> that's evil IO type stuff, we noble function
Here's a clean-up of my code (it even fits within the line-length limit of my
mail client :)). Note that it's pretty much exactly the Python algorithm. When
the Python program finds a solution, it prints the board and exits. Since
that's evil IO type stuff, we noble functional folk instead set u
On Mon, Dec 01, 2008 at 01:02:40AM +, Ross Paterson wrote:
> I am also willing to remove any release with an unchanged name and
> made without the support of the maintainer. You have made clear that
> the DrIFT-2.2.3 upload is in that category, so I have now removed it.
> Looking through, the
---
Haskell Weekly News
http://sequence.complete.org/hwn/20081130
Issue 95 - November 30, 2008
---
Welcome to issue 95 of HWN, a newsletter covering
ajb:
> G'day all.
>
> Quoting Don Stewart <[EMAIL PROTECTED]>:
>
> >So, team, anyone want to implement a Knight's Tour solver in a list
> >monad/list comprehension one liner? These little puzzles are made for
> >fast languages with backtracking monads
>
> I conjecture that any one-liner won'
G'day all.
Quoting Don Stewart <[EMAIL PROTECTED]>:
So, team, anyone want to implement a Knight's Tour solver in a list
monad/list comprehension one liner? These little puzzles are made for
fast languages with backtracking monads
I conjecture that any one-liner won't be efficient.
Anyway
On Sun, Nov 30, 2008 at 08:50:51AM -0800, John Meacham wrote:
> And creating a crippled version of something you wrote and passing it
> off as the original, in a way that clearly breaks things for other
> people definitely is something to get upset about.
There was a discussion of this issue on th
On Sun, Nov 30, 2008 at 3:13 PM, Martijn van Steenbergen
<[EMAIL PROTECTED]> wrote:
> Luke Palmer wrote:
>>
>> The other nice one problem is allowing the argument itself to be
>> infinite (you have to require all of the lists to be nonempty).
>
> I think the requirement has to be a lot stronger for
duncan.coutts:
> On Sun, 2008-11-30 at 10:57 +, Andrew Coppin wrote:
>
> > As I understand it, that's also a seperate download. (Whereas the cabal
> > library comes with GHC.)
> >
> > One day, if I feel hard-core enough, I might try this tool. (Assuming it
> > works on Windows...) It sounds
On Sun, 2008-11-30 at 10:57 +, Andrew Coppin wrote:
> As I understand it, that's also a seperate download. (Whereas the cabal
> library comes with GHC.)
>
> One day, if I feel hard-core enough, I might try this tool. (Assuming it
> works on Windows...) It sounds potentially useful.
It will
On Sat, 2008-11-29 at 17:49 -0800, John Meacham wrote:
> On Sun, Nov 30, 2008 at 01:37:20AM +, Thomas Schilling wrote:
> > So that's over 2 SLOC, but, of course, for a more powerful tool.
> > So I presume the 4x more code remark by John was about the Makefile
> > rules to implement somethin
On Sun, 2008-11-30 at 21:14 +0100, Henning Thielemann wrote:
> On Sun, 30 Nov 2008, Don Stewart wrote:
>
> > lemming:
> >>
> >> Maybe you like to add a pointer in cabal-install.cabal/Homepage field to
> >> this page.
> >
> > Good idea. Duncan?
>
> After I finished that article, I also found:
>
Luke Palmer wrote:
The other nice one problem is allowing the argument itself to be
infinite (you have to require all of the lists to be nonempty).
I think the requirement has to be a lot stronger for that to work.
If every sublist has two elements, the answer is 2^infinity lists which
is unc
Hi Ganesh,
> Are there any Haskell libraries around for manipulating predicate formulae?
> I had a look on hackage but couldn't spot anything.
http://www.cs.york.ac.uk/fp/darcs/proposition/
Unreleased, but might be of interest. It simplifies propositional
formulae, and can do so using algebraic
Ryan Ingram wrote:
A common mistake (and a confusing bit about typeclasses) is that
whether or not the constraints on an instance apply are irrelevant.
Specifically, the code "instance (Applicative f, Eq a) => AppEq f a"
means that, given any types f and a, I can tell you how to make them
an ins
Lee Pike forwarded the following:
"Solving the Knight's Tour Puzzle In 60 Lines of Python"
http://developers.slashdot.org/article.pl?sid=08/11/30/1722203
Seems that perhaps (someone expert in) Haskell could do even better?
Maybe even parallelize the problem? :)
So, team, anyo
You can have seq and lifted tuples, but the implementation of seq
requires parallel evaluation.
-- Lennart
On Sun, Nov 30, 2008 at 7:00 PM, Luke Palmer <[EMAIL PROTECTED]> wrote:
> On Sun, Nov 30, 2008 at 10:43 AM, Max Rabkin <[EMAIL PROTECTED]> wrote:
>> On Sun, Nov 30, 2008 at 9:30 AM, Luke P
andrewcoppin:
> Ahn, Ki Yung wrote:
> >Andrew Coppin 쓴 글:
> >>Then again, one day I sat down and tried to draw a diagram of the
> >>essential concepts, techniques and syntax of Haskell and how they're
> >>related... The result looked like alphabet soup! It's not clear how
> >>you start to explai
On Sun, Nov 30, 2008 at 2:07 PM, Martijn van Steenbergen
<[EMAIL PROTECTED]> wrote:
> Larry Evans wrote:
>>
>> The haskell code:
>>
>> cross::[[a]]->[[a]]
>>
>> calculate a cross product of values.
>
> Now if you allow the elements of that function's argument list to be
> possibly infinite lists a
Larry Evans wrote:
The haskell code:
cross::[[a]]->[[a]]
calculate a cross product of values.
Now if you allow the elements of that function's argument list to be
possibly infinite lists and you still want to eventually yield every
possible cross product, you get a very nice problem...
Ahn, Ki Yung wrote:
Andrew Coppin 쓴 글:
Then again, one day I sat down and tried to draw a diagram of the
essential concepts, techniques and syntax of Haskell and how they're
related... The result looked like alphabet soup! It's not clear how
you start to explain anything without immediately ne
On Sun, 30 Nov 2008, Don Stewart wrote:
Maybe it is time for a "Haskell for the Web" collection.
Two days ago I initialized
http://www.haskell.org/haskellwiki/Category:Web
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.o
s.clover:
> Haxr provides a basic implementation of the XML-RPC protocol, and
> while it looks like it doesn' t build on 6.10 at the moment, getting
> it to build shouldn't be a problem, and although it doesn't appear to
> be under active development, it does seem to be getting maintenance
[Re-sending to the list, sorry for the doubled mail, John]
Hi John,
Am Samstag, den 08.11.2008, 12:32 -0800 schrieb John MacFarlane:
> I've uploaded an early version of gitit, a Haskell wiki program, to
> HackageDB. Gitit uses HAppS as a webserver, git for file storage,
> pandoc for rendering the
Jake Mcarthur wrote:
Heh, after a couple more seconds of thought, reversing the two
composed functions fixes it:
nub . permutations
Of course, neither my previous nonsolution nor this solution are
efficient for long lists, but I think it serves as a decent reference
implementation at lea
On Sun, 30 Nov 2008, Don Stewart wrote:
lemming:
Maybe you like to add a pointer in cabal-install.cabal/Homepage field to
this page.
Good idea. Duncan?
After I finished that article, I also found:
http://hackage.haskell.org/trac/hackage/wiki/CabalInstall
On Sun, 30 Nov 2008, Don Stewart wrote:
*if* .. *might* .. *assuming* .. *potentially* .. *maybe* .. *if*..
You could have built it by now!
Source:
http://hackage.haskell.org/packages/archive/cabal-install/0.6.0/cabal-install-0.6.0.tar.gz
Dependencies that aren't in core:
daniel.is.fischer:
> Am Sonntag, 30. November 2008 20:46 schrieb Don Stewart:
> > andrewcoppin:
> > > Thomas Schilling wrote:
> > > >Cabal-the-install-tool (package "cabal-install") is actually a
> > > >different program that sits on top of Cabal-the-library, and it is in
> > > >fact what really pr
Am Sonntag, 30. November 2008 20:46 schrieb Don Stewart:
> andrewcoppin:
> > Thomas Schilling wrote:
> > >Cabal-the-install-tool (package "cabal-install") is actually a
> > >different program that sits on top of Cabal-the-library, and it is in
> > >fact what really provides the real advantages. To
john:
> On Sat, Nov 29, 2008 at 09:00:48PM -0500, Brandon S. Allbery KF8NH wrote:
> > On 2008 Nov 29, at 20:02, John Meacham wrote:
> >> Oh golly. I never put DrIFT on cabal, apparently whomever tried to
> >> cabalize it didn't include the ghc driver script, and also appeared to
> >> just drop the
andrewcoppin:
> Thomas Schilling wrote:
> >Cabal-the-install-tool (package "cabal-install") is actually a
> >different program that sits on top of Cabal-the-library, and it is in
> >fact what really provides the real advantages. Together with Hackage
> >this is what provides the killer feature of
Hi,
Are there any Haskell libraries around for manipulating predicate
formulae? I had a look on hackage but couldn't spot anything.
I am generating complex expressions that I'd like some programmatic help
in simplifying.
Cheers,
Ganesh
___
Haskel
On 11/30/08 12:27, Luke Palmer wrote:
On Sun, Nov 30, 2008 at 11:04 AM, Larry Evans <[EMAIL PROTECTED]> wrote:
The following post:
http://thread.gmane.org/gmane.comp.lib.boost.devel/182797
shows at least one person that would find it useful, at least in
c++. Of course maybe it would be less
Am Sonntag, 30. November 2008 19:04 schrieb Larry Evans:
> > If you're asking whether crossn, as a single function which handles
> > arbitrarily many arguments, can be defined, the short answer is "no".
> > I dare you to come up with a case in which such function adds more
> > than cursory convenie
On Sun, Nov 30, 2008 at 11:04 AM, Larry Evans <[EMAIL PROTECTED]> wrote:
> The following post:
>
> http://thread.gmane.org/gmane.comp.lib.boost.devel/182797
>
> shows at least one person that would find it useful, at least in
> c++. Of course maybe it would be less useful in haskell.
The line:
On 11/30/08 12:04, Larry Evans wrote:
[snip]
The following post:
http://thread.gmane.org/gmane.comp.lib.boost.devel/182797
shows at least one person that would find it useful, at least in
c++. Of course maybe it would be less useful in haskell.
One thing that maybe confusing things is that
Tuples would still be distinguishable from lists, since "cons" changes
their type: (b,c,d) and (a,b,c,d) would have different types, while
[b,c,d] and [a,b,c,d] wouldn't.
On 30 Nov 2008, at 20:48, Brandon S. Allbery KF8NH wrote:
On 2008 Nov 30, at 12:43, Max Rabkin wrote:
On Sun, Nov 30, 20
On Sun, Nov 30, 2008 at 10:43 AM, Max Rabkin <[EMAIL PROTECTED]> wrote:
> On Sun, Nov 30, 2008 at 9:30 AM, Luke Palmer <[EMAIL PROTECTED]> wrote:
>> cross :: [a] -> [b] -> [(a,b)]
>>
>> It's just kind of a pain (you build [(a,(b,(c,d)))] and then flatten
>> out the tuples). The applicative notat
On 11/30/08 11:30, Luke Palmer wrote:
On Sun, Nov 30, 2008 at 10:25 AM, Larry Evans <[EMAIL PROTECTED]> wrote:
Is there some version of haskell, maybe template haskell,
that can do that, i.e. instead of:
cross::[[a]] -> [[a]]
have:
crossn::[a0]->[a1]->...->[an] -> [(a0,a1,...,an)]
Ah yes!
Daniel Fischer wrote:
> Needs an Ord constraint:
>
> inserts :: [a] -> [a] -> [[a]]
> inserts [] ys = [ys]
> inserts xs [] = [xs]
> inserts xs@(x:xt) ys@(y:yt) = [x:zs | zs <- inserts xt ys]
> ++ [y:zs | zs <- inserts xs yt]
Heh, I came up with basically the same th
On Sun, 30 Nov 2008, Brandon S. Allbery KF8NH wrote:
On 2008 Nov 30, at 12:43, Max Rabkin wrote:
It seems to me like this would all be easy if (a,b,c,d) was sugar for
(a,(b,(c,d))), and I can't see a disadvantage to that.
No disadvantage aside from it making tuples indistinguishable from li
On 2008 Nov 30, at 12:43, Max Rabkin wrote:
On Sun, Nov 30, 2008 at 9:30 AM, Luke Palmer <[EMAIL PROTECTED]>
wrote:
cross :: [a] -> [b] -> [(a,b)]
It's just kind of a pain (you build [(a,(b,(c,d)))] and then flatten
out the tuples). The applicative notation is a neat little trick
which does
On Sunday 30 November 2008 6:28:29 am Roman Leshchinskiy wrote:
> On 30/11/2008, at 11:36, Don Stewart wrote:
> > Should mutable arrays have list-like APIs? All the usual operations,
> > just in-place and destructive where appropriate?
>
> I don't know. To be honest, I don't think that the term "mu
On Sun, Nov 30, 2008 at 9:30 AM, Luke Palmer <[EMAIL PROTECTED]> wrote:
> cross :: [a] -> [b] -> [(a,b)]
>
> It's just kind of a pain (you build [(a,(b,(c,d)))] and then flatten
> out the tuples). The applicative notation is a neat little trick
> which does this work for you.
It seems to me lik
On Sun, Nov 30, 2008 at 10:25 AM, Larry Evans <[EMAIL PROTECTED]> wrote:
> Is there some version of haskell, maybe template haskell,
> that can do that, i.e. instead of:
>
> cross::[[a]] -> [[a]]
>
> have:
>
> crossn::[a0]->[a1]->...->[an] -> [(a0,a1,...,an)]
Ah yes! This is straightforward usa
On 11/23/08 13:52, Luke Palmer wrote:
2008/11/23 Larry Evans <[EMAIL PROTECTED]>:
http://www.muitovar.com/monad/moncow.xhtml#list
contains a cross function which calculates the cross product
of two lists. That attached does the same but then
used cross on 3 lists. Naturally, I thought use of
First line is necessary, because the second line is written in
assumption that the first element of a permutation does really exist.
On 30 Nov 2008, at 19:49, Andrew Coppin wrote:
Miguel Mitrofanov wrote:
eqPerms [] = [[]]
eqPerms xs = [x:xt | x <- nub xs, xt <- eqPerms $ delete x xs]
Well
On Sun, Nov 30, 2008 at 17:45:55 +0100, Daniel Fischer wrote:
> I am now a proud owner of darcs-2.1.2, the source distribution built without
> problems :), make test said "All tests successful!" three times :D
> Sorry to deprive you of the pleasure of helping.
:-)
> > darcs failed: Can't unde
Daniel Fischer wrote:
Am Sonntag, 30. November 2008 17:29 schrieb Andrew Coppin:
Jake Mcarthur wrote:
Seems a bit easy, I think.
Data.List.permutations . nub
Damnit, I specifically looked through Data.List to see if a permutation
function exists... how did I miss that?! o_O
Haxr provides a basic implementation of the XML-RPC protocol, and
while it looks like it doesn' t build on 6.10 at the moment, getting
it to build shouldn't be a problem, and although it doesn't appear to
be under active development, it does seem to be getting maintenance
uploads. [1]
The
On Sat, Nov 29, 2008 at 09:00:48PM -0500, Brandon S. Allbery KF8NH wrote:
> On 2008 Nov 29, at 20:02, John Meacham wrote:
>> Oh golly. I never put DrIFT on cabal, apparently whomever tried to
>> cabalize it didn't include the ghc driver script, and also appeared to
>> just drop the documentation fr
Miguel Mitrofanov wrote:
eqPerms [] = [[]]
eqPerms xs = [x:xt | x <- nub xs, xt <- eqPerms $ delete x xs]
Well, that's one way... ;-)
I'm still not precisely sure why the first line must exist, but it seems
no matter which way round you do it, that line is needed. Probably due
to some subtle
Am Sonntag, 30. November 2008 17:29 schrieb Andrew Coppin:
> Jake Mcarthur wrote:
> > Seems a bit easy, I think.
> >
> > Data.List.permutations . nub
>
> Damnit, I specifically looked through Data.List to see if a permutation
> function exists... how did I miss that?! o_O
>
> (Hoogle didn't fin
import Data.List
eqPerms [] = [[]]
eqPerms xs = [x:xt | x <- nub xs, xt <- eqPerms $ delete x xs]
On 30 Nov 2008, at 18:03, Andrew Coppin wrote:
OK, so here's something just for fun:
Given a list of items, find all possible *unique* permutations of
that list. (E.g., the input list is explici
On Sat, Nov 29, 2008 at 05:10:24PM -0800, Don Stewart wrote:
> > Oh golly. I never put DrIFT on cabal, apparently whomever tried to
> > cabalize it didn't include the ghc driver script, and also appeared to
> > just drop the documentation from the package altogether. It is things
> > like that that
Am Sonntag, 30. November 2008 15:57 schrieb Eric Kow:
> Hi Daniel,
>
> On Sun, Nov 30, 2008 at 08:31:15 -0500, [EMAIL PROTECTED]
wrote:
> > [EMAIL PROTECTED]:~/lhc> darcs get --partial http://code.haskell.org/lhc
> > Invalid repository: http://code.haskell.org/lhc
> >
> > darcs failed: failed to
Jake Mcarthur wrote:
Seems a bit easy, I think.
Data.List.permutations . nub
Damnit, I specifically looked through Data.List to see if a permutation
function exists... how did I miss that?! o_O
(Hoogle didn't find it either.)
Well either way, it's still entertaining to find ways to imp
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Nov 30, 2008, at 10:17 AM, Luke Palmer wrote:
On Sun, Nov 30, 2008 at 9:06 AM, Jake Mcarthur <[EMAIL PROTECTED]>
wrote:
Seems a bit easy, I think.
Data.List.permutations . nub
That is not what he meant. Given:
[1,1,2,2]
The results sho
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Nov 30, 2008, at 10:17 AM, Luke Palmer wrote:
On Sun, Nov 30, 2008 at 9:06 AM, Jake Mcarthur <[EMAIL PROTECTED]>
wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Nov 30, 2008, at 9:03 AM, Andrew Coppin wrote:
OK, so here's something j
On Sun, Nov 30, 2008 at 9:06 AM, Jake Mcarthur <[EMAIL PROTECTED]> wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> On Nov 30, 2008, at 9:03 AM, Andrew Coppin wrote:
>>
>> OK, so here's something just for fun:
>>
>> Given a list of items, find all possible *unique* permutations of that
Am Sonntag, 30. November 2008 16:03 schrieb Andrew Coppin:
> OK, so here's something just for fun:
>
> Given a list of items, find all possible *unique* permutations of that
> list. (E.g., the input list is explicitly _allowed_ to contain
> duplicates. The output list should not contain any duplica
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Nov 30, 2008, at 9:03 AM, Andrew Coppin wrote:
OK, so here's something just for fun:
Given a list of items, find all possible *unique* permutations of
that list. (E.g., the input list is explicitly _allowed_ to contain
duplicates. The output
OK, so here's something just for fun:
Given a list of items, find all possible *unique* permutations of that
list. (E.g., the input list is explicitly _allowed_ to contain
duplicates. The output list should not contain any duplicate permutations.)
I've found one simple way to do this, but I'm
Hi Daniel,
On Sun, Nov 30, 2008 at 08:31:15 -0500, [EMAIL PROTECTED] wrote:
> [EMAIL PROTECTED]:~/lhc> darcs get --partial http://code.haskell.org/lhc
> Invalid repository: http://code.haskell.org/lhc
>
> darcs failed: failed to fetch: http://code.haskell.org/lhc/_darcs/inventory
> ExitFailure
Should mutable arrays have list-like APIs? All the usual operations,
just in-place and destructive where appropriate?
I don't know. To be honest, I don't think that the term "mutable
array" describes a single data structure. For instance, one of the
central questions which unveils a whole bu
On 30/11/2008, at 11:36, Don Stewart wrote:
Should mutable arrays have list-like APIs? All the usual operations,
just in-place and destructive where appropriate?
I don't know. To be honest, I don't think that the term "mutable
array" describes a single data structure. For instance, one of th
Thomas Schilling wrote:
Cabal-the-install-tool (package "cabal-install") is actually a
different program that sits on top of Cabal-the-library, and it is in
fact what really provides the real advantages. Together with Hackage
this is what provides the killer feature of "cabal install foo",
howev
John MacFarlane wrote:
> Can anyone explain why ghc does not treat the following
> as a valid literate haskell program?
>
> - test.lhs
> # This is a test
>
> > foo = reverse . words
>
>
I believe this is an artifact of ghc trying to parse cpp style line
num
70 matches
Mail list logo
