Hi Gregory,
The package hmatrix [1] checks for LAPACK and BLAS (and GSL) using a
simple script [2] (but it does not compile fortran sources, only a few C
helper functions).
[1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hmatrix
[2]
2009/11/18 Twan van Laarhoven twa...@gmail.com:
The TDNR proposal really tries to do two separate things:
1. Record syntax for function application.
The proposal is to tread x.f or a variation thereof the same as (f x)
2. Type directed name lookup.
The proposal is to look up
| The proposal has this sentence, apparently in reference to using
| qualified imports: This is sufficient, but it is just sufficiently
| inconvenient that people don't use it much. Does this mean qualified
| imports?
I clarified.
| One thing I'd really like that this would provide is shorter
Excerpts from Twan van Laarhoven's message of Thu Nov 19 00:59:25 +0100 2009:
Levi Greenspan wrote:
What's the status of the TDNR proposal [1]? Personally I think it is a
very good idea and I'd like to see it in Haskell'/GHC rather sooner
than later. Working around the limitations of the
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of S.
Doaitse Swierstra
How about:
http://hackage.haskell.org/package/orchid
a simple, but nice wiki produced by one of our students Sebastiaan
Visser,
You can see it in action here:
On Mon, Nov 16, 2009 at 6:26 PM, Gwern Branwen gwe...@gmail.com wrote:
...
Too late:
...
http://hackage.haskell.org/package/loli
What's the point with loli?
Cristiano
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 18/11/2009 04:05, Malcolm Wallace wrote:
The documentation claim that The default implementation of 'deepseq'
is simply 'seq' is not exactly right, as `deepseq` and `seq` have
different signatures.
Yes indeed. In order to use deepseq, it looks like I also need some way
to force the ()
On Thu, 19 Nov 2009, Daniel Fischer wrote:
A separate package for that orphan instance would be the best solution.
I'm not sure that's really better. With a separate package, you'd have
dependencies
packageY, orphanInstance.
When a new version of packageY with the instance is uploaded,
On 19/11/2009 11:52, Sittampalam, Ganesh wrote:
Yitzchak Gale wrote:
Simon Marlow wrote:
So then what shall we call the a - () version?
One possibility is to go back to calling it rnf.
In light of apfelmus' comment, I vote for rnf.
And in that case, how about the analogous alternative for
On Thu, Nov 19, 2009 at 10:47 AM, Cristiano Paris fr...@theshire.org wrote:
On Mon, Nov 16, 2009 at 6:26 PM, Gwern Branwen gwe...@gmail.com wrote:
...
Too late:
...
http://hackage.haskell.org/package/loli
What's the point with loli?
Mrs Lopsided has all the loli.
D
--
Dougal Stanton
Hi Cafe!
I am struggling with an interesting problem while defining a function. It
looks quite easy to me, but I couldn't manage to have a proper
implementation yet.
To illustrate what I'm trying to achive, I'll introduce special cases of the
desired function, and hopefully build towards a
You can easily use sequence. The less easy part is understanding why
it works. Are you familiar with monads? If you are not, try to take
the source code of 'sequence', inline it and understand why *that*
works.
Prelude map sum $ sequence [[1,2], [10,20], [100,200]]
Ozgur Akgun wrote:
Anyway, just forget the fact that these funstions do not do a check on
the length of the input list for a moment. My question is, how can I
generalize this function to accept a list of lists of arbitrary
length, and produce the required result.
Hi,
The concise solution is
Thanks for the both quick answers.
This is what happens all the time, the thing I am trying to implement is
already in the library!
Neil,
I clearly understood the way you implemented. Actually I had a similar
implementation with some problems, one of which is the base-case you
mentioned.
Hi,
I wrote some Template Haskell templates that I think may be of use to others.
The first generates in and with functions for newtypes.
For example, using it one can replace this code (from TypeCompose):
inFlip :: ((a~b) - (a' ~~ b')) - (Flip (~) b a - Flip (~~) b' a')
inFlip = (Flip .).(.
Nicolas Pouillard wrote:
The TDNR proposal really tries to do two separate things:
1. Record syntax for function application.
The proposal is to tread x.f or a variation thereof the same as (f x)
It is more like (ModuleToGuess.f x) than (f x).
My point is that desugaring x.f to (f
This is what happens all the time, the thing I am trying to implement is
already in the library!
You can easily find those library functions using Hoogle.
In this case Hoogle gives the sequence function as its second result
for the query [[a]] - [[a]]:
Data.List transpose :: [[a]] - [[a]]
One of Knuth's sources is the well-named book Hacker's Delight by
Henry S. Warren; see hackersdelight.org
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Just an aside, derived Show doesn't try to be truly minimal with respect to
superfluous ()'s at this point, for instance it doesn't take into
consideration that when using infixl or infixr you can elide them on one
side, so there is already a precedent for the fact that the ()'s that get
used are
You're right. I do that sometimes, but I must make a habit of hoogling.
2009/11/19 yair...@gmail.com yair...@gmail.com
This is what happens all the time, the thing I am trying to implement is
already in the library!
You can easily find those library functions using Hoogle.
In this case
I did not notice when this was released, but I saw it on Hackage
yesterday and, with it, wrote some of the easiest bindings to a fairly
complex C API I've written in a while. This package is excellent! Thank
you for sharing it.
My only complaint is that the macros get confused if you use a
I did not notice when this was released, but I saw it on Hackage
yesterday and, with it, wrote some of the easiest bindings to a
fairly complex C API I've written in a while. This package is
excellent! Thank you for sharing it.
Thanks. My hope is that it saves as much time from users as the
I'd like to ask the cafe's advice on how to 'do this right'.
The situation is that we've got 2 literate Haskell programs which we
would like to refactor. In fact, this refactoring will ultimately unify
these 2 separate programs into a single framework. Every refactoring
step is well-defined
Maurício CA wrote:
My only complaint is that the macros get confused if you use a
Haskell type that has a single quote in it.
Can you give me an example?
It turns out that I read the documentation incorrectly, but here is what
I was trying to do.
I had two structs, one of which used
Hi,
community.haskell.org isn't responding, I get connection failures.
Thanks, Neil
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Got the following:
Building uvector-0.1.0.5...
[ 1 of 13] Compiling Data.Array.Vector.Prim.Text (
Data/Array/Vector/Prim/Text.hs, dist/build/Data/Array/Vector/Prim/Text.o )
Prologue junk?: .type sD7_entry, @function
sD7_entry:
# 25 /tmp/ghc14266_0/ghc14266_0.hc 1
That seems bad...
I had two structs, one of which used the other as a field type.
I was using the generated identifier of the first as the type
for the second, so it had the form c'STRUCT_NAME. So the field
macro looked like this:
#field foo , c'STRUCT_NAME
It did not like this, complaining about the
On Thu, 2009-11-19 at 21:15 +, Neil Mitchell wrote:
Hi,
community.haskell.org isn't responding, I get connection failures.
Ta, sorted.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
For those interested, I've just released 0.2 -- no new features, but
it's got a slightly cleaner API. Fewer modules, proper datetime types,
and a few more documentation entries. And the innards are sane now.
https://dl.dropbox.com/u/1947532/gnome-keyring_0.2/index.html
-- Forwarded message --
From: Tom Hawkins tomahawk...@gmail.com
Date: Thu, Nov 19, 2009 at 9:31 PM
Subject: Re: [Haskell-cafe] ANNOUNCE: feldspar-language
To: Emil Axelsson e...@chalmers.se
On Thu, Nov 19, 2009 at 5:58 PM, Emil Axelsson e...@chalmers.se wrote:
Hi Tom, thanks for
Interesting to see actual generated code.
Is this like code generation systems for database applications where
you stick stuff into string templates (e.g., a generator in Ruby on
Rails), or is it actually compiling an embedded domain specific
language?
On Thu, Nov 19, 2009 at 6:55 PM, Tom
On Fri, Nov 20, 2009 at 4:14 AM, Warren Henning
warren.henn...@gmail.com wrote:
Interesting to see actual generated code.
Is this like code generation systems for database applications where
you stick stuff into string templates (e.g., a generator in Ruby on
Rails), or is it actually
Twan van Laarhoven wrote:
My point is that desugaring x.f to (f x) and treating some instances
of (f x) as (ModuleToGuess.f x) are two separate things. In the
current proposal these two are combined, but I see no reason to do so.
To be a bit more concrete, I would propose:
* General Type
33 matches
Mail list logo
