Duncan Coutts writes:
>> The "build operation" part often ends up a bit gross, but I have a plan
>> for that which I hope to come back to later on.
>
> Yes, they're not good for construction atm. The Builder monoid from the
I've used that a bit, but that's not what I'm talking about.
Serializing
Stefan Holdermans wrote:
> Erik,
>
> >> http://people.cs.uu.nl/stefan/pubs/hage08heap.html
>
> > Getting connection refused on that.
>
> Don't know: it still works for me.
Working for me as well now.
Cheers,
Erik
--
--
Eri
> And this is confusing to those of us who are not compiler experts.
>
> Haskell knows when I have a list of Doubles, you know, because it's strongly
> typed.
>
> Then it proceeds to box them. Huh ?
>
> The laziness thing has many example od _reducing_ efficiency, but there
> seems to be a real lac
Erik,
http://people.cs.uu.nl/stefan/pubs/hage08heap.html
Getting connection refused on that.
Don't know: it still works for me.
Cheers,
Stefan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/has
On Thu, Nov 5, 2009 at 6:15 PM, brian wrote:
>
> On Nov 5, 2009, at 8:26 AM, Jason Dagit wrote:
>
>
>>
>> Haskell knows when I have a list of Doubles, you know, because it's
>> strongly typed.
>>
>> Then it proceeds to box them. Huh ?
>>
>> Imagine a computation which will yield a Double if evalu
Henning Thielemann skrev:
On Wed, 4 Nov 2009, Emil Axelsson wrote:
I'm happy to announce the first release of Feldspar, which is an embedded
domain-specific language with associated code generator mainly targeting DSP
algorithms. The language is developed in cooperation by Ericsson, Chalmers
Hector Guilarte wrote:
Hi Luke,
The code is mainly in Spanish with son parts in English...
Thanks for the explanation, I got the idea very well, but now I got some
questions about that.
How does the Prelude functions for managing lists work? I mean, what does zip, unzip,
foldl, foldr, map an
On Nov 5, 2009, at 8:26 AM, Jason Dagit wrote:
Haskell knows when I have a list of Doubles, you know, because it's
strongly typed.
Then it proceeds to box them. Huh ?
Imagine a computation which will yield a Double if evaluated, but
has not yet been evaluated. How do you store that i
On Nov 5, 2009, at 8:26 AM, Jason Dagit wrote:
I can't really think of how laziness and polymorphism are related.
For me the big win with laziness is composability. Laziness allows
us to express things in ways that are more natural. The prelude
function 'take' is a perfect example. I
Steve yahoo.com.au> writes:
>
> On Tue, 2009-11-03 at 10:52 -0500, Will wrote:
> > I've just tried it and it was twice slower than mine. (?) I didn't use
> > the [Int]
> > signature in both. [...] It runs twice as fast with it).
> > Although your
> > code has an advantage that it is very easy to
Roman Leshchinskiy wrote:
wren ng thornton wrote:
Roman Leshchinskiy wrote:
On 04/11/2009, at 13:23, Daniel Peebles wrote:
In the presence of fusion (as is the case in uvector), it's hard to
give meaningful time complexities for operations as they depend on
what operations they are paired with
On Wed, 4 Nov 2009, Sjoerd Visscher wrote:
On Nov 4, 2009, at 3:21 PM, Twan van Laarhoven wrote:
I looked on hackage but I was surprised that I couldn't find this simple
monad. The package level-monad does look very similar, only it uses a
different list type for the represe
On Wed, 4 Nov 2009, Emil Axelsson wrote:
I'm happy to announce the first release of Feldspar, which is an embedded
domain-specific language with associated code generator mainly targeting DSP
algorithms. The language is developed in cooperation by Ericsson, Chalmers
University and Eötvös Lorá
On Tue, 3 Nov 2009, Warren Henning wrote:
I see that section 4.1 of the user guide -
http://feldspar.sourceforge.net/documents/language/FeldsparLanguage.html#htoc23
- includes an example involving autocorrelation.
Does this mean I could use Feldspare to easily build my own Autotune
program? I
2009/11/6 Deniz Dogan :
> 2009/11/6 Erik de Castro Lopo :
>> Stefan Holdermans wrote:
>>
>>> http://people.cs.uu.nl/stefan/pubs/hage08heap.html
>>
>> Getting connection refused on that.
>>
>
> Try this one, from Google's cache:
> http://preview.tinyurl.com/ydjuw2j
>
> --
> Deniz Dogan
>
Oops, t
2009/11/6 Erik de Castro Lopo :
> Stefan Holdermans wrote:
>
>> http://people.cs.uu.nl/stefan/pubs/hage08heap.html
>
> Getting connection refused on that.
>
Try this one, from Google's cache:
http://preview.tinyurl.com/ydjuw2j
--
Deniz Dogan
___
Has
Stefan Holdermans wrote:
>http://people.cs.uu.nl/stefan/pubs/hage08heap.html
Getting connection refused on that.
Erik
--
--
Erik de Castro Lopo
http://www.mega-nerd.com/
___
Haske
On Thu, Nov 5, 2009 at 4:46 AM, Boris Lykah wrote:
>
> Hi all!
>
> I was playing with pointfree tool from hackage and found that it produces
> wrong code for some functions which use list comprehension.
>
> Here are several examples:
>
> :main f x = concat [x:f x| x<-[0..x-1]]
> f = fix ((join .)
Andrew Coppin wrote:
> Depends what you develop. I know of plenty of developers who use MS
> Visual Studio for everything, for example.
And those developers do not care whether Haskell libraries compile
on windows or not.
> You can pretend that Windows isn't popular and thus there's no need to
A comparison of the evolution in speed of Haskell from version to version
rather than with other languages could have been very informative about the
progress in haskell speed. I think that the progression has been
astonishing.
I though that while seeing this language shootout in windows
http://d
On Thu, Nov 5, 2009 at 11:11 PM, Andrew Coppin
wrote:
> Matus Tejiscak wrote:
>>
>> zygohistomorphic prepromorphisms
>
> Please tell me this isn't a real technical term. o_O
>
You can even generalize them:
g_prepro_zygo :: (Functor f, Comonad w) => GAlgebra f w b -> Dist f w
-> GAlgebra f (ZygoT
Deniz Dogan wrote:
> 2009/11/5 Erik de Castro Lopo :
>
> > In addition, saying "90% of all desktop computers" is misleading;
> > instead we should be talking about the computers of software developers
> > and there, the figure is almost certainly well below 90%.
> >
>
> Why? After all, software i
Deniz Dogan wrote:
2009/11/5 Andrew Coppin :
Matus Tejiscak wrote:
zygohistomorphic prepromorphisms
Please tell me this isn't a real technical term. o_O
http://www.haskell.org/haskellwiki/Zygohistomorphic_prepromorphisms
Still can't tell if it's a joke or not...
You might also be interest
And we wonder why Haskell isn't mainstream...
On Thu, Nov 5, 2009 at 4:31 PM, Deniz Dogan wrote:
> 2009/11/5 Andrew Coppin :
>> Matus Tejiscak wrote:
>>>
>>> zygohistomorphic prepromorphisms
>>
>> Please tell me this isn't a real technical term. o_O
>
> http://www.haskell.org/haskellwiki/Zygohist
Andrew,
As for concrete suggestions... I've always thought we could do more
to use static information about the program to aid runtime GC. It's
no deep secret that destructive updates are essentially like a
compile-time / coding-time GC operation. You determine before
runtime that the old
2009/11/5 Andrew Coppin :
> Matus Tejiscak wrote:
>>
>> zygohistomorphic prepromorphisms
>
> Please tell me this isn't a real technical term. o_O
http://www.haskell.org/haskellwiki/Zygohistomorphic_prepromorphisms
Still can't tell if it's a joke or not...
--
Deniz Dogan
Am Donnerstag 05 November 2009 23:02:30 schrieb Erik de Castro Lopo:
> Andrew Coppin wrote:
> > I'm dissapointed that Haskell doesn't have *more* of a Windows bias. It
> > _is_ the platform used by 90% of the desktop computers, after all. (As
> > unfortunate as that undeniably is...)
>
> That is no
2009/11/5 Erik de Castro Lopo :
> Andrew Coppin wrote:
>
>> I'm dissapointed that Haskell doesn't have *more* of a Windows bias. It
>> _is_ the platform used by 90% of the desktop computers, after all. (As
>> unfortunate as that undeniably is...)
>
> That is not true in my home and its not true whe
Erik de Castro Lopo wrote:
Andrew Coppin wrote:
I'm dissapointed that Haskell doesn't have *more* of a Windows bias. It
_is_ the platform used by 90% of the desktop computers, after all. (As
unfortunate as that undeniably is...)
That is not true in my home and its not true where I wo
On Tue, 3 Nov 2009, Jose Iborra wrote:
On 03/11/2009, at 14:24, Henning Thielemann wrote:
Sure, this is a nice functionality. But isn't it about debugging, not
exception handling? Internal Server Error means to me, the server has a
bug, thus we want to know, how to reproduce it, thus the stac
Matus Tejiscak wrote:
zygohistomorphic prepromorphisms
Please tell me this isn't a real technical term. o_O
As for concrete suggestions... I've always thought we could do more to
use static information about the program to aid runtime GC. It's no deep
secret that destructive updates are esse
Andrew Coppin wrote:
> I'm dissapointed that Haskell doesn't have *more* of a Windows bias. It
> _is_ the platform used by 90% of the desktop computers, after all. (As
> unfortunate as that undeniably is...)
That is not true in my home and its not true where I work.
In addition, saying "90% of
On Thu, Nov 5, 2009 at 4:34 PM, Andrew Coppin
wrote:
> Nicolas Pouillard wrote:
>>
>> Excerpts from Neil Brown's message of Tue Nov 03 13:45:42 +0100 2009:
>>
>>>
>>> Hi,
>>>
>>> I was thinking about some of my code today, and I realised that where I
>>> have an arrow in my code, A b c, the type (
Hi,
Is it possible to somehow make a StorableVector of a StorableVector via
store-record or
something?
If yes, could some one please provide me with some hint?
storable-record just assists with generating Storable instances. It helps
using correct aligment and correct order of entries. It d
2009/11/5 Edward Kmett :
> On Thu, Nov 5, 2009 at 10:59 AM, Stefan Monnier
> wrote:
>>
>> > We could really use a case statement in which we skip the scrutinee and
>> > make
>> > (case of {})' be syntactic sugar for `(\x -> case x of {})'.
>>
>> > So we could write:
>>
>> >> myFunc = anotherFunc $
Martin DeMello wrote:
On Wed, Nov 4, 2009 at 10:34 AM, Richard O'Keefe wrote:
(4) It comes with its own IDE. I don't think it can do anything much that
Haskell tools can't do, but if you don't like looking for things, it's
a help.
And a well-integrated GUI toolkit. If it weren'
Nicolas Pouillard wrote:
Excerpts from Neil Brown's message of Tue Nov 03 13:45:42 +0100 2009:
Hi,
I was thinking about some of my code today, and I realised that where I
have an arrow in my code, A b c, the type (A b) is also a functor. The
definition is (see
http://www.haskell.org/ghc/
I figured out an inductive approach as follows, which lets you derive
stripeN from stripe(N-1). This could be TemplateHaskell'd if you have a
bound on N; I'm still trying to figure out a type-magical alternative.
Suppose stripe(N-1) :: x -> [b] -> [c]
Then
stripeN :: (a -> [b]) -> x -> [a] -> [
> +1
If we're counting increments, should add in previous instances of the
same proposal - Andrew Pimlott Sep 2005 on haskell-cafe, at least.
I agree with Stefan Monnier, might as well allow pattern alternatives
in lambda expressions - essentially the same idea and allows multiple
case parameters
Excerpts from Martijn van Steenbergen's message of Thu Nov 05 16:54:36 +0100
2009:
> Sebastiaan Visser wrote:
> > > myFunc = anotherFunc $ case of
> > > Left err -> print err
> > > Right msg -> putStrLn msg
> >
> > A minor syntactical addition,
2009/11/5 Sebastiaan Visser :
> Hello all,
>
> Wouldn't it be nice if we could write point free case statements?
>
> I regularly find myself writing down something like this:
>
>> myFunc = anotherFunc $ \x -> case x of
>> Left err -> print err
>>
Don't these things generally get added as LANGUAGE pragmas though? If
it's off by default then peoples code should be okay.
Also, I'd prefer something like `cases` as the keyword, rather than
`case of`, mostly for aesthetics, but also so that, upon visual
inspection, I wouldn't wonder where
42 matches
Mail list logo
