In Feldspar's module for observable sharing [1] I use the following
{-# OPTIONS_GHC -O0 #-}
which I assumed would take care of the steps required for
unsafePerformIO. Could someone please tell if this assumption is correct?
(Of course, observable sharing is not safe regardless, but that's
Hello.
I am hoping to take on the Data Structures project proposed two years ago by
Don Stewart herehttp://hackage.haskell.org/trac/summer-of-code/ticket/1549,
this summer.
Before I write up my proposal to Google, I wanted to gauge the reaction of
the Haskell community to this project.
Nathan Hunter enfer...@gmail.com wrote:
-What Data Structures in the current libraries are in most dire need
of improvement?
-How necessary do you think a Containers Library revision is?
-Should I attempt to build on the work Jamie Brandon did with Map as
generalised tries, or is that beyond
Hello,
I'm writing a library for dealing with binders and I want to benchmark
it against DeBruijn, Locally Nameless, HOAS, etc.
One on my benchmark consists in
1. generating a big term \x.t
2. substituting u fox in t
The part I want to benchmark is 2. In particular I would like that:
a.
Excerpts from Paul Brauner's message of Wed Mar 31 03:17:02 -0400 2010:
The part I want to benchmark is 2. In particular I would like that:
a. \x.t is already evaluated when I run 2 (I don't want to measure the
performances of the generator)
b. the action of substituting u for x in t
On Wed, Mar 31, 2010 at 9:17 AM, Paul Brauner paul.brau...@loria.fr wrote:
Does anyone have an idea why calling rnf before the bench
doesn't seem to cache the result as calling show does?
(my instances of NFData follow the scheme described in strictbench
documentation).
Is it possible you
On 31/03/2010, at 18:14, Achim Schneider wrote:
We have a lot of useful interfaces (e.g. ListLike, Edison), but they
don't seem to enjoy wide-spread popularity.
Perhaps that's an indication that we need different interfaces? IMO, huge
classes which generalise every useful function we can
Nathan,
For what it is worth: I'd propose that Data.HashTable needs to be
replaced; it appears to me having played around with it and found it
wanting that its limitations are pretty common knowledge in the Haskell
community. (I'm sure most people on this list would already know much
more about
Hi,
Quoting bri...@aracnet.com:
which is a variation of the question, why can't I compare
localtimes ?
or am I missing something in Time (yet again).
Am Mittwoch, den 31.03.2010, 01:32 -0400 schrieb wagne...@seas.upenn.edu:
Two values of LocalTime may well be computed with respect to
Malcolm would have to attest to how complete it is w.r.t. say, gcc's
preprocessor,
cpphs is intended to be as faithful to the CPP standard as possible,
whilst still retaining the extra flexibility we want in a non-C
environment, e.g. retaining the operator symbols //, /*, and */. If
the
Hello,
actually I don't know if I can. I totally wouldn't mind but this is
mainly my co-author work and I don't know if he would (I suppose not but
since he is sleeping right now I can't check). However let's assume it's
a deBruijn representation for instance, I can tell you the scheme I
used:
On Tuesday 30 March 2010 4:34:10 pm Ashley Yakeley wrote:
Worse than that, if bottom is a value, then Hask is not a category! Note
that while undefined is bottom, (id . undefined) and (undefined . id)
are not.
Hask can be a category even if bottom is a value, with slight modification.
That
Hi everyone and Alberto,
Numeric.LinearProgramming[1] provides a very nice interface for solving LP
optimisation problems, and the well-known simplex algorithm itself. I must
say I quite liked the interface it provides, simple yet sufficient.
But, to my understanding, there is a confusion in the
Note that, if any student is interested, the Haskell Neural Network library
[1] is being rewritten from scratch. We (Thomas Bereknyi and I) are
discussing many core data structure alternatives, with some suggestions from
Edward Kmett. There may even be some room for a rewrite or update of fgl,
Hi Everybody,
I've started reading SPJ's book - When I tried to execute some sample code
in miranda, I found that Miranda does not seem to recognize things like
import Utils
or
module Langauge where ...
Has someone created a clean compilable miranda source out of this book?
--
Regards,
Kashyap
On Wed, Mar 31, 2010 at 1:19 PM, Alp Mestanogullari a...@mestan.fr wrote:
Note that, if any student is interested, the Haskell Neural Network library
[1] is being rewritten from scratch. We (Thomas Bereknyi and I) are
discussing many core data structure alternatives, with some suggestions from
Darryn Reid wrote:
I've coded a (fairly) general rewriting traversal - I suspect the
approach might be generalisable to all tree-like types, but this doesn't
concern me much right now. My purpose is for building theorem provers
for a number of logics, separating the overall control mechanism
2010/3/31 C K Kashyap ckkash...@gmail.com:
Hi Everybody,
I've started reading SPJ's book - When I tried to execute some sample code
in miranda, I found that Miranda does not seem to recognize things like
import Utils
or
module Langauge where ...
Has someone created a clean compilable
Great ... thanks Thu ...
Regards,
Kashyap
On Wed, Mar 31, 2010 at 4:15 PM, minh thu not...@gmail.com wrote:
2010/3/31 C K Kashyap ckkash...@gmail.com:
Hi Everybody,
I've started reading SPJ's book - When I tried to execute some sample
code
in miranda, I found that Miranda does not seem
On Wed, Mar 31, 2010 at 11:06 AM, Paul Brauner paul.brau...@loria.fr wrote:
data Term = Lam Term | App Term Term | Var Int
instance NFData where
rnf (Lam t) = rnf t
rnf (App t1 t2) = rnf t1 `seq` rnf t2
rnf (Var x) = rnf x
the actual datatype doesn't have fancy stuff like
Well, you can join #hnn or #haskell-soc to discuss that with us. But don't
put too much hope on that, I'm quite sure it isn't GSoC worthy. OTOH, any
contribution is always welcome heh.
On Wed, Mar 31, 2010 at 12:39 PM, Mihai Maruseac
mihai.marus...@gmail.comwrote:
On Wed, Mar 31, 2010 at 1:19
On Mon, Mar 29, 2010 at 3:44 AM, Christopher Done
chrisd...@googlemail.com wrote:
This is a post about re-designing the whole Haskell web site.
I really like the design a lot. Here are some ideas:
- There are several news streams going on at once. Perhaps Headlines
and Events could be merged
On Wed, Mar 31, 2010 at 12:57 PM, Bas van Dijk v.dijk@gmail.com wrote:
main = let !t = genterm in defaultMain [bench subst $ nf (subst u) t]
Oops, that should be:
main = let t = genterm in rnf t `seq` defaultMain [bench subst $ nf
(subst u) t]
Bas
Looks like some functions are left as an exercise... I'd appreciate it if
someone could share a complete code for the Core language
On Wed, Mar 31, 2010 at 4:20 PM, C K Kashyap ckkash...@gmail.com wrote:
Great ... thanks Thu ...
Regards,
Kashyap
On Wed, Mar 31, 2010 at 4:15 PM, minh thu
Thank you, I will look at that. But it seems that criterion uses NFData
no?
Paul
On Wed, Mar 31, 2010 at 12:57:20PM +0200, Bas van Dijk wrote:
On Wed, Mar 31, 2010 at 11:06 AM, Paul Brauner paul.brau...@loria.fr wrote:
data Term = Lam Term | App Term Term | Var Int
instance NFData where
Thanks, Ivan, for the note about the other alternatives and about
possible additions to your library (and of course for the library
itself!).
I should mention that I completely missed containers in the
hierarchical libraries (I was just looking in the base libraries).
Sorry about that.
Lee Pike leep...@gmail.com writes:
I should mention that I completely missed containers in the
hierarchical libraries (I was just looking in the base libraries).
Sorry about that.
Oh, I thought you had done what most of us do: seen Data.Graph in
containers and promptly dismissed it... _
From: Roman Leshchinskiy r...@cse.unsw.edu.au
On 31/03/2010, at 18:14, Achim Schneider wrote:
We have a lot of useful interfaces (e.g. ListLike, Edison), but they
don't seem to enjoy wide-spread popularity.
Perhaps that's an indication that we need different interfaces? IMO, huge
classes
Oh, I thought you had done what most of us do: seen Data.Graph in
containers and promptly dismissed it... _
(IIRC, it doesn't really have many graph operations defined there.)
Yes, you're right---I just wanted to acknowledge that I'd missed that
there was *something* there...
Lee
On Mon, Mar 29, 2010 at 4:48 PM, Steve Schafer st...@fenestra.com wrote:
On Sun, 28 Mar 2010 20:38:49 -0700, you wrote:
* The difference between genders is smaller than the difference between
individuals
If only people would understand and accept the near-universality of
this:
The
Hello,
On this spring day I would like to announce the 2.0 release of
Hakyll[1], the static site generator. It is a rewrite, changes the API
for the better and introduces some new features. A brief changelog:
- Rewrite of the codebase to a clean, arrow based API.
- Pagination was added.
-
Hello,
i'm using PHPProxy to go on the internet (www.phpproxy.fr).
How can i tell cabal to use this?
Cheers,
Corentin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Ozgur,
You are right, the operators are misleading. I will change them to
:=: and :=:. And perhaps the symbol :: for the interval bound
should also be improved...
Thanks for your suggestion!
Alberto
Ozgur Akgun wrote:
Hi everyone and Alberto,
Numeric.LinearProgramming[1] provides a
You are very welcome :)
What about not an operator but a regular constructor for the interval thing?
Something like: Between Double Double
Nevertheless, I think :: is not bad at all. You can leave it as it is.
Best,
On 31 March 2010 14:57, Alberto Ruiz ar...@um.es wrote:
Hi Ozgur,
You are
On 30/03/2010 20:57, Mihai Maruseac wrote:
I'd like to introduce my idea for the Haskell GSOC of this year. In
fact, you already know about it, since I've talked about it here on
the haskell-cafe, on my blog and on reddit (even on #haskell one day).
Basically, what I'm trying to do is a new
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Dupont Corentin
i'm using PHPProxy to go on the internet (www.phpproxy.fr).
How can i tell cabal to use this?
I think the normal way is through setting HTTP_PROXY env var e.g. set
On 04/03/2010 22:01, Neil Brown wrote:
Jesper Louis Andersen wrote:
On Thu, Mar 4, 2010 at 8:35 PM, Neil Brown nc...@kent.ac.uk wrote:
CML is indeed the library that has the most markedly different
behaviour.
In Haskell, the CML package manages to produce timings like this for
fairly
simple
Thanks for the response.
I don't think this will work because PHPProxy is a web based proxy.
To use it, you have to type the http address you want in a field on the page.
Corentin
On 3/31/10, Bayley, Alistair alistair.bay...@invesco.com wrote:
From: haskell-cafe-boun...@haskell.org
I'm wondering... Since the DPH libraries are shipped with GHC by default are we
allowed to use them for the shootout?
Roman
On 30/03/2010, at 19:25, Simon Marlow wrote:
The shootout (sorry, Computer Language Benchmarks Game) recently updated to
GHC 6.12.1, and many of the results got worse.
On 31/03/2010 16:06, Roman Leshchinskiy wrote:
I'm wondering... Since the DPH libraries are shipped with GHC by default are we
allowed to use them for the shootout?
I don't see why not.
*evil grin*
Simon
Roman
On 30/03/2010, at 19:25, Simon Marlow wrote:
The shootout (sorry, Computer
On Wed, Mar 31, 2010 at 7:21 AM, Simon Marlow marlo...@gmail.com wrote:
On 30/03/2010 20:57, Mihai Maruseac wrote:
I'd like to introduce my idea for the Haskell GSOC of this year. In
fact, you already know about it, since I've talked about it here on
the haskell-cafe, on my blog and on
I was working through this book last year, and posted my work at
https://patch-tag.com/r/wh5a/CoreCompiler/home. It was almost
complete.
On Wed, Mar 31, 2010 at 7:12 AM, C K Kashyap ckkash...@gmail.com wrote:
Looks like some functions are left as an exercise... I'd appreciate it if
someone
I'm looking at iteratee as a way to replace my erroneous and really
inefficient lazy-IO-based backend for an expect like Monad DSL I've been
working for about 6 months or so now on and off.
The problem is I want something like:
expect some String
send some response
to block or perhaps timeout,
Certainly.
rl:
I'm wondering... Since the DPH libraries are shipped with GHC by default are
we allowed to use them for the shootout?
Roman
On 30/03/2010, at 19:25, Simon Marlow wrote:
The shootout (sorry, Computer Language Benchmarks Game) recently updated to
GHC 6.12.1, and many
Thanks Wei ... Having a working version would really help in going through
the tutorial better.
On Wed, Mar 31, 2010 at 9:32 PM, Wei Hu wei@gmail.com wrote:
I was working through this book last year, and posted my work at
https://patch-tag.com/r/wh5a/CoreCompiler/home. It was almost
DekuDekuplex:
Sorry for the late response, but just out of curiosity, are there any
plans to provide a binary installer for either the Haskell Platform or
GHC 6.12.1 for Mac OS X Leopard for the PowerPC CPU (as opposed to for
the Intel x86 CPU)? I just checked the download-related Web sites
On Wed, Mar 31, 2010 at 4:12 AM, Paul Brauner paul.brau...@loria.fr wrote:
Thank you, I will look at that. But it seems that criterion uses NFData no?
I do not know of anything wrong with NFData. What you're seeing is much more
likely to be a bug in either the benchmarking library you're
There are a number of us over on #hnn on freenode hacking away on the
beginnings of a shiny new graph library based on some new tricks for
annotated structures. Feel free to swing by the channel.
-Edward Kmett
On Tue, Mar 30, 2010 at 10:23 PM, Ivan Miljenovic ivan.miljeno...@gmail.com
wrote:
I'm looking at iteratee as a way to replace my erroneous and really
inefficient lazy-IO-based backend for an expect like Monad DSL I've
been working for about 6 months or so now on and off.
The problem is I want something like:
expect some String
send some response
to block or perhaps
Nathan Hunter wrote:
Hello.
I am hoping to take on the Data Structures project proposed two years ago by
Don Stewart herehttp://hackage.haskell.org/trac/summer-of-code/ticket/1549,
this summer.
Before I write up my proposal to Google, I wanted to gauge the reaction of
the Haskell community to
First thanks for the reply,
On Wed, Mar 31, 2010 at 11:15 AM, Valery V. Vorotyntsev valery...@gmail.com
wrote:
I'm looking at iteratee as a way to replace my erroneous and really
inefficient lazy-IO-based backend for an expect like Monad DSL I've
been working for about 6 months or so now
David Leimbach leim...@gmail.com writes:
to block or perhaps timeout, depending on the environment, looking for
some String on an input Handle, and it appears that iteratee works
in a very fixed block size. While a fixed block size is ok, if I can
put back unused bytes into the enumerator
On Wed, Mar 31, 2010 at 12:02 PM, Gregory Collins
g...@gregorycollins.netwrote:
David Leimbach leim...@gmail.com writes:
to block or perhaps timeout, depending on the environment, looking for
some String on an input Handle, and it appears that iteratee works
in a very fixed block size.
Han Joosten wrote:
The haskell platform should take care of a lot of installation pain,
specially for the non-technical users.
I note with dismay that there's a proposal to remove OpenGL from HP.
Assuming this gets approved, that'll be one less library that you can
use on Windows. I thought
On Wed, Mar 31, 2010 at 12:24 PM, David Leimbach leim...@gmail.com wrote:
On Wed, Mar 31, 2010 at 12:02 PM, Gregory Collins g...@gregorycollins.net
wrote:
David Leimbach leim...@gmail.com writes:
to block or perhaps timeout, depending on the environment, looking for
some String on an
Dear haskell-cafe,
I've been thinking about space leaks lately. In particular, I've been
studying the tricky example with pairs
break [] = ([],[])
break (x:xs) = if x == '\n' then ([],xs) else (x:ys,zs)
where (ys,zs) = break xs
which was discussed in the papers
Jan
On Mar 30, 1:26 am, Simon Marlow marlo...@gmail.com wrote:
The shootout (sorry, Computer Language Benchmarks Game) ...
In a different time, in a different place, the shootout meant a football once
again flying over the cross bar or harmlessly into the arms of the keeper and
England once more
i'm using PHPProxy to go on the internet (www.phpproxy.fr).
How can i tell cabal to use this?
...
PHPProxy is a web based proxy. To use it, you have to type the http
address you want in a field on the page.
You still need some web access in order to access a web-based proxy...
Is
Hi Dave,
From: David Leimbach leim...@gmail.com
I'm looking at iteratee as a way to replace my erroneous and really
inefficient lazy-IO-based backend for an expect like Monad DSL I've been
working for about 6 months or so now on and off.
The problem is I want something like:
expect some
On Wed, Mar 31, 2010 at 2:12 PM, John Lato jwl...@gmail.com wrote:
Hi Dave,
From: David Leimbach leim...@gmail.com
I'm looking at iteratee as a way to replace my erroneous and really
inefficient lazy-IO-based backend for an expect like Monad DSL I've been
working for about 6 months or
On Wed, Mar 31, 2010 at 7:42 PM, David Leimbach leim...@gmail.com wrote:
What I mean is let's say the stream has
abcd efg abcd efg
and then I run some kind of iteratee computation looking for abcd
You could adapt the 'heads' function from the iteratee package to do this:
Heinrich,
Thanks for your excellent response! Indeed, it was the rebuilding of the
tree that had me stumped. I also see the benefits of using the lift
functions, thanks again for this insight.
Darryn.
On Wed, 2010-03-31 at 12:44 +0200, Heinrich Apfelmus wrote:
Darryn Reid wrote:
I've coded
Hi all,
I've been studying Haskell for about a year now, and I've really come
to like it. In my daily work I write a lot of BASH shell scripts and I
thought I'd try add some of the haskell features and constructs to
BASH to make my scripting life a bit easier. So I've been working on a
small BASH
On 1 April 2010 11:05, Patrick LeBoutillier
patrick.leboutill...@gmail.com wrote:
Basically I'm looking for a bit of feedback/info:
- Does anyone know if there are already similar projets out there?
On Hackage: LambdaShell, language-sh, HSH, Hashell (dead), only, Shellac
Note that not all of
I tend to install haskell packages from apt whenever possible. One such
package is unix, which appears to come provided by the ghc6 debian
package. I'm trying to cabal install lambdabot and getting the following:
$ cabal install lambdabot
Resolving dependencies...
Configuring
On 1 April 2010 11:42, Alex Rozenshteyn rpglove...@gmail.com wrote:
Main.hs:11:7:
Could not find module `System.Posix.Signals':
It is a member of the hidden package `unix-2.4.0.0'.
Perhaps you need to add `unix' to the build-depends in your .cabal
file.
Interesting, because
$ ghc-pkg check
outputs nothing
$ ghc-pkg list unix
/var/lib/ghc-6.12.1/package.conf.d
unix-2.4.0.0
/home/alex/.ghc/x86_64-linux-6.12.1/package.conf.d
unix appears to be in the build-depends of the Library, but not in the
build-depends of Executable lambdabot
Adding unix to the second
On Wed, 31 Mar 2010 01:32:56 -0400
wagne...@seas.upenn.edu wrote:
Two values of LocalTime may well be computed with respect to
different timezones, which makes the operation you ask for dangerous.
First convert to UTCTime (with localTimeToUTC), then compare.
that makes sense. unfortunately
Hi,
Nobody seems to have any idea what is happening yet. Though thanks for
trying dagit (forgot to add haskell-cafe to my repliess to him).
Quick update incase it helps, compiling with profiling and running with the
-xc option results in,
Main.CAF:runInputT_rOASystem.Posix.Files.CAFSegmentation
On Wed, 2010-03-31 at 19:29 -0700, bri...@aracnet.com wrote:
On Wed, 31 Mar 2010 01:32:56 -0400
wagne...@seas.upenn.edu wrote:
Two values of LocalTime may well be computed with respect to
different timezones, which makes the operation you ask for dangerous.
First convert to UTCTime (with
On Thu, 01 Apr 2010 06:20:25 +0200
Maciej Piechotka uzytkown...@gmail.com wrote:
On Wed, 2010-03-31 at 19:29 -0700, bri...@aracnet.com wrote:
On Wed, 31 Mar 2010 01:32:56 -0400
wagne...@seas.upenn.edu wrote:
Two values of LocalTime may well be computed with respect to
different
-- logfloat 0.12.1
This package provides a type for storing numbers in the log-domain,
primarily useful for preventing underflow when multiplying many
probabilities as in HMMs and other probabilistic
72 matches
Mail list logo
