#701: Better CSE optimisation
-+--
Reporter: simonmar |Owner:
Type: task | Status: new
Priority: normal|Milestone:
#2889: Compilation fails - Can't open temporary
---+
Reporter: fobrock | Owner: igloo
Type: bug | Status: new
Priority: normal| Milestone: 6.14.1
Component:
Hi!
I see here:
http://hackage.haskell.org/trac/ghc/wiki/TypeFunctionsStatus
That defaults in type families are not yet implemented. But how far is this?
And how far is overall implementation of this? There seems to be a lot
of open bugs around that? Are type families meant to be used or is
Dear Haskellers,
In recent years, haskell.org has started to receive assets, e.g. money
from Google Summer Of Code, donations for Hackathons, and a Sparc
machine for use in GHC development. We have also started spending this
money: on the community server, on a server to take over hosting
On Sun, Sep 5, 2010 at 3:40 PM, Ian Lynagh ig...@earth.li wrote:
Dear Haskellers,
In recent years, haskell.org has started to receive assets, e.g. money
from Google Summer Of Code, donations for Hackathons, and a Sparc
machine for use in GHC development. We have also started spending this
Hi,
I'm happy to announce the first release of secure-sockets, a library which
aims to simplify the task of communicating securely between two
authenticated peers.
-- What it is
The API mimicks that of
If however something goes wrong, and prs fails, the whole function
fails (error is thrown). Since [a] (result of decoding) is a lazy
list, actual exception may be thrown at any moment the list is being
processed, and exception handler may not be properly set.
True - return (reverse a)
False
On 05/09/2010, at 2:38 AM, Michael Litchard wrote:
I'll be starting a new job soon as systems tool guy. The shop is a
perl shop as far as internal automation tasks go. But I am fortunate
to not be working with bigots. If they see a better way, they'll take
to it. So please give me your best
On Sun, 5 Sep 2010, Dimitry Golubovsky wrote:
Hi,
The following function* is supposed to decode a list of some
serialized objects following each other in a lazy Bytestring:
many :: Get a - Get [a]
many prs = many' [] where
many' a = do
s - prs
r - isEmpty
case r of
True -
Also any half decent binary format should tell you how long the list
is *before* you parse it, either:
1) How many elements it has - for this you just need a counting
version of the many combinator.
2) The length of bytes that the flattened list takes. In this case the
repeating combinator has
On 5 sep 2010, at 09:28, Ben Lippmeier wrote:
On 05/09/2010, at 2:38 AM, Michael Litchard wrote:
I'll be starting a new job soon as systems tool guy. The shop is a
perl shop as far as internal automation tasks go. But I am fortunate
to not be working with bigots. If they see a better way,
Thomas DuBuisson wrote:
There is a blog on this [1], but the main points about the new class
are:
1) Generates bytestrings, not Ints
I like this one because it's semantically truer (tm). ;-)
2) Generalized PRNG construction and reseeding
...which takes the great burden off it's users
Hello,
Just want to share some results of my weekend hacking.
It is clear that haskell type checker can help to build a list of
suggestions for autocomplete (very old idea). I tried to create a very basic
prototype to play with the idea.
The approach I used:
The task can be divided into the
Serguey Zefirov sergu...@gmail.com wrote:
You had selected wxWidgets because of what?
Because of the neat grid class in wxWidgets. I did not find
anything comparable in gtk.
Also, how long did it took (especially GUI part)?
Hard to say, because I work on that project on irregular times in my
Seems cool, but I do not really get it : why write it in haskell ? I
thought at first that your formula language was haskell, but it
looks more like a php derivative.
This formula language is just a very simple language to insert formulas into
cells. It has nothing to do with haskell.
Does
On Fri, Sep 3, 2010 at 12:01 PM, C. McCann c...@uptoisomorphism.net wrote:
On Fri, Sep 3, 2010 at 11:47 AM, John Lato jwl...@gmail.com wrote:
On Fri, Sep 3, 2010 at 1:29 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 3 September 2010 22:23, John Lato jwl...@gmail.com wrote:
On Sat, Sep 4, 2010 at 12:34 PM, David Menendez d...@zednenem.com wrote:
On Fri, Sep 3, 2010 at 8:23 AM, John Lato jwl...@gmail.com wrote:
+1 for using the proper constraints, and especially for bringing over
Pointed (and anything else that applies).
What's the argument for Pointed? Are
On 5 September 2010 22:40, John Lato jwl...@gmail.com wrote:
Having Pointed is categorically the right thing to do, which is why I argue
for its inclusion. Also, I think it would be prudent to avoid a situation
with the possibility of turning into a rehash of the
Functor/Applicative/Monad
On Sun, Sep 5, 2010 at 7:47 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 5 September 2010 22:40, John Lato jwl...@gmail.com wrote:
Having Pointed is categorically the right thing to do, which is why I
argue
for its inclusion. Also, I think it would be prudent to avoid a
Just because we don't have
a use now doesn't mean it might not be useful in the future.
I am suspicious about complicating a design for potential future
benefits.
However, difference lists provide an example of a type that support
Pointed more naturally than Applicative: the dlist package
On 6 September 2010 00:11, Sebastian Fischer
s...@informatik.uni-kiel.de wrote:
Just because we don't have
a use now doesn't mean it might not be useful in the future.
I am suspicious about complicating a design for potential future benefits.
However, difference lists provide an example of a
On Saturday 04 September 2010 00:21:39, Jan Christiansen wrote:
On 03.09.2010, at 14:38, Daniel Fischer wrote:
I can't reproduce that. For me, it leaks also with profiling.
Have you used optimizations?
Of course. Always do :)
It disappears if I compile the program with -O2.
Yeah, without
Quoth Ben Lippmeier b...@ouroborus.net,
...
Grandiose, hand-wavy assertions like strong typing leads to
shorter development times and more reliable software don't work
on people that haven't already been there and done that. When you
try to ram something down someone's throat they tend to
Gaius:
My usual rhetoric is that one-off, throwaway scripts never are, and
not only do they tend to stay around but they take on a life of their
own. Today's 10-line file munger is tomorrow's thousand-line ETL batch
job on which the business depends for some crucial data - yet the
original
Quoth Dimitry Golubovsky golubov...@gmail.com,
Is there any way to catch/detect failures inside the Get monad? It is
not an instance of MonadError, so catchError does not work.
Ideally, the function would keep decoding as long as it is possible,
and upon the first failure of the parser,
donn:
Quoth Dimitry Golubovsky golubov...@gmail.com,
Is there any way to catch/detect failures inside the Get monad? It is
not an instance of MonadError, so catchError does not work.
Ideally, the function would keep decoding as long as it is possible,
and upon the first failure of the
On Sun, Sep 5, 2010 at 8:40 AM, John Lato jwl...@gmail.com wrote:
On Sat, Sep 4, 2010 at 12:34 PM, David Menendez d...@zednenem.com wrote:
On Fri, Sep 3, 2010 at 8:23 AM, John Lato jwl...@gmail.com wrote:
+1 for using the proper constraints, and especially for bringing over
Pointed (and
On Sun, Sep 5, 2010 at 8:47 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
I _can_ think of a data type that could conceivably be an instance of
Pointed but not Applicative: a BloomFilter (though there's not really
any point in having a BloomFilter with only one value that I can
On 05.09.2010 22:02, Don Stewart wrote:
For strict, checked binary parsing, use the cereal package. For lazy
binary parsing with async errors, use binary.
Unfortunately cereal is too slow. I got ~5x slowdown with cereal and had
to patch binary in order to incorporated error handling
The darcs team would like to announce the immediate availability of darcs 2.5
beta 5 (also known as darcs 2.4.98.5 due to Cabal restrictions). Important
changes since darcs 2.4.4 are:
* trackdown can now do binary search with the --bisect option
* darcs always stores patch metadata encoded
If however something goes wrong, and prs fails, the whole function
fails (error is thrown). Since [a] (result of decoding) is a lazy
list, actual exception may be thrown at any moment the list is being
processed, and exception handler may not be properly set.
True - return (reverse a)
False
Hello,
Is it possible to define variable names according to input data? For
instance:
input = I k = Int k
input = I m= Int m
input = S s= String s
Of course, the real application is much more complicated, but the basic
question is the same.
Many thanks,
Maria
On 5 September 2010 21:04, Maria Merit mariam627...@gmail.com wrote:
Is it possible to define variable names according to input data? For
instance:
You can do arbitrary IO in TemplateHaskell. So, theoretically yes, you
can define variables depending on input. But it has to be input during
On Sun, 5 Sep 2010, Maria Merit wrote:
Hello,
Is it possible to define variable names according to input data? For instance:
input = I k = Int k
input = I m= Int m
input = S s = String s
No this is not possible. However you can use
Data.Map String Object
with
data Object =
Michael Litchard wrote:
I'll be starting a new job soon as systems tool guy. The shop is a
perl shop as far as internal automation tasks go. But I am fortunate
to not be working with bigots. If they see a better way, they'll take
to it. So please give me your best arguments in favor of using
Daniel Fischer schrieb:
Yes. Ordinarily, lines in text files aren't longer than a few hundred
characters, leaking those, who cares?
I got several space leaks of this kind in the past. They are very
annoying. They are especially annoying if input comes from the outside
world, where people can
Johannes Waldmann wrote:
Ivan Lazar Miljenovic ivan.miljenovic at gmail.com writes:
... the only thing that changed of significance was the
exception handling: Control.Exception now uses extensible exceptions
base-4 also introduced the Control.Category.Category class and
restructured
Neil Brown schrieb:
On 03/09/10 11:11, Henning Thielemann wrote:
E.g. I wanted to have a Set of Gaussian (complex) integers, but I did
not want to define an Ord instance for them, because writing
a (b :: Gaussian)
is a bug with high probability.
Isn't this what newtype is good for?
On Sunday 05 September 2010 21:52:44, Henning Thielemann wrote:
Daniel Fischer schrieb:
Yes. Ordinarily, lines in text files aren't longer than a few hundred
characters, leaking those, who cares?
I got several space leaks of this kind in the past. They are very
annoying. They are
Dear Haskellers,
In recent years, haskell.org has started to receive assets, e.g. money
from Google Summer Of Code, donations for Hackathons, and a Sparc
machine for use in GHC development. We have also started spending this
money: on the community server, on a server to take over hosting
I think there should be Graphics.Drawing (along with Graphics.Rendering) and
many graphics packages should go into it.
So
* Graphics.Rendering will contain more technical and rendering-engine-level
packages (OpenGL, GD, ...)
* while Graphics.Drawing will be for higher-level and user-friendlier
If they are perl programmers, they (should) understand perl very well. I
would suggest to try explaining to them the obvious disadvantages of perl
and the way that Haskell can cover those disadvantages without (much) of a
compromise.
Perl programs are either ones that are ridiculously
Ian Lynagh:
To fix this problem, we propose that we create a haskell.org
committee, which is responsible for answering these sorts of questions,
although for some questions they may choose to poll the community at
large if they think appropriate.
[..]
Unfortunately, this gives us a
On 6 September 2010 04:25, David Menendez d...@zednenem.com wrote:
On Sun, Sep 5, 2010 at 8:47 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
I _can_ think of a data type that could conceivably be an instance of
Pointed but not Applicative: a BloomFilter (though there's not really
On 6 September 2010 10:09, han e...@xtendo.org wrote:
I think there should be Graphics.Drawing (along with Graphics.Rendering) and
many graphics packages should go into it.
Why?
So
* Graphics.Rendering will contain more technical and rendering-engine-level
packages (OpenGL, GD, ...)
*
On Sun, Sep 5, 2010 at 3:40 PM, Ian Lynagh ig...@earth.li wrote:
Dear Haskellers,
In recent years, haskell.org has started to receive assets, e.g. money
from Google Summer Of Code, donations for Hackathons, and a Sparc
machine for use in GHC development. We have also started spending this
Hi,
I'm happy to announce the first release of secure-sockets, a library which
aims to simplify the task of communicating securely between two
authenticated peers.
-- What it is
The API mimicks that of
On Sep 5, 2010, at 7:46 PM, Mathew de Detrich wrote:
Another thing you can say is that Perl is a very extreme language in
design where as Haskell is more general. This means the one thing
Perl does, it does very well (expressing programming problems in the
most concise/short possible way)
48 matches
Mail list logo
