Hi,
Am Sonntag, den 13.10.2013, 17:50 +0200 schrieb Michael Snoyman:
I wanted to announce that FP Complete is now running a Jenkins job to
build Stackage with GHC 7.8. You can see the current results in the
relevant Github issue[1]. Essentially, we're still trying to get
version bounds
Hi,
Am Montag, den 14.10.2013, 15:34 +0200 schrieb Vlatko Basic:
Looks like we're missing the point here. I did add the PPAs, and all
is OK for me. :-)
LTS is a stable release, and yet many other apps get updated regulary,
but GHC does not. GHC is not part of the system itself, it's just an
Hi,
I’ll be visiting Madrid next week (research visit) and I’m wondering if
there are any Haskell or FP Group meeting or other events that might be
interesting? I could possibly contribute a talk. (Both preferably in
English.)
Wednesday or Thursday evening might would most convenient.
Hi,
Am Mittwoch, den 04.09.2013, 14:46 +0200 schrieb Adam Bergmark:
You might be interested in these two comment threads (and maybe the
rest of the comments as well):
http://www.reddit.com/r/haskell/comments/1ldqav/thoughts_on_uhc_vs_haste_vs_fay/cbyrhwz
Hi,
Am Samstag, den 17.08.2013, 11:11 +0200 schrieb Christopher Done:
inv reverse (take 10)
if you want that fast and lazy, check out
http://www.joachim-breitner.de/blog/archives/600-On-taking-the-last-n-elements-of-a-list.html
Greetings,
Joachim
--
Joachim “nomeata” Breitner
Hi,
Am Samstag, den 10.08.2013, 10:49 +0200 schrieb Henning Thielemann:
Recently I found that links from Google search results to archive
Haskell-Cafe messages are invalid. The messages are still there, but got
a different number. E.g. the search result says:
Hi,
Am Montag, den 12.08.2013, 14:52 +0200 schrieb Sven Panne:
2013/8/12 Joachim Breitner m...@joachim-breitner.de:
happens with mailman/pipermail occasionally.
o_O That's news to me... Why/how does this happen? This sounds like a
serious bug to me, the URLs should really, really be stable
Hi,
Am Mittwoch, den 24.07.2013, 01:41 -0700 schrieb Michael Sloan:
Another non-answer is to take a look at using vaccum[0] and
vaccum-graphviz[1] together, to get an idea of the heap structure of
unforced values. I've made a gist demonstrating how to use these to
visualize the heap without
Hi,
Am Freitag, den 19.07.2013, 11:19 +0200 schrieb John Blackbox:
The question about generating the code was only to have a debugging
tool - to see if the generated AST is good - I wanted to generate the
Haskell code only to check if its correct, but normally I would not do
it, because it
://github.com/jaspervdj/stylish-haskell/ (found via
http://stackoverflow.com/q/6870148/946226) which formats just some very
few aspects of Haskell. Does anyone have a more complete solution? Or is
interested in creating one?
Greetings,
Joachim
--
Joachim Breitner
e-Mail: m...@joachim-breitner.de
Hi,
Am Montag, den 01.07.2013, 07:59 -0400 schrieb Richard Cobbe:
How does the indentation tool know if (a b c) is supposed to be the next
item in the do block, or merely a continuation of the previous application
of f?
I would still expect the developer to write correctly intended Haskell,
Hi,
Daniel Silverstone has a 10-episode video-cast on Haskell at
http://www.youtube.com/playlist?list=PL_xuff3BkASMOzBr0hKVKLuSnU4UIinKx
and 5 Project Euler solution at
http://www.youtube.com/playlist?list=PL_xuff3BkASMwjdTdsqWn5j4VcLGG5jem
Greetings,
Joachim
--
Joachim “nomeata” Breitner
Hi,
Am Donnerstag, den 13.06.2013, 09:59 +0800 schrieb Niklas Hambüchen:
In many discussions we make guesses about how much code proposals like
Functor = Monad would break.
You can use https://github.com/dterei/Hackager to build all of Hackage
(preferably in a VM).
Of course many
HI,
Am Donnerstag, den 23.05.2013, 12:38 +0400 schrieb Anton Kholomiov:
I wish it was possible to use an extension
CustomPrelude = Prelude.Prime
In the cabal file
as far as I know, GHC simply issues an implicit
import Prelude
without package qualifiers. So you can get what you want by
Hi,
Am Donnerstag, den 23.05.2013, 11:52 +0200 schrieb Bas van Dijk:
On 23 May 2013 11:26, Joachim Breitner m...@joachim-breitner.de wrote:
So you can get what you want by not
depending on base, but rather have prelude-prime re-export all modules
from base plus its own Preldue.
How
Hi,
Am Montag, den 22.04.2013, 16:44 -0400 schrieb Clark Gaebel:
More interestingly, the problem goes away if I enable profiling.
That's kind of worrisome.
this part sounds similar than the recently discussed problem with the
ackermann function (http://hackage.haskell.org/trac/ghc/ticket/7850)
Hi,
I believe one problem with non-linear patterns would be that the
compiler has to figure out what notion of equality you want here. An
obvious choice is (==), but the Eq instances might not do what you want.
Using pattern guards or view patterns explicates this choice.
Also, without an
Hi,
Am Samstag, den 06.04.2013, 03:09 -0400 schrieb Ryan Newton:
This is an NCurses front end for visualizing a dynamic collection of
text streams (e.g. as produced by make -j or cabal -j). It just
splits the window when more streams appear.
Hi,
Am Donnerstag, den 28.03.2013, 07:40 +0100 schrieb Heinrich Hördegen:
Is there a deeper sens or is it just a little bit inconsistent?
looks like the latter to me. The report states
Moreover, it is invalid to give more than one type signature for
one variable, even if the
Hi,
Am Mittwoch, den 20.03.2013, 00:34 +0100 schrieb Corentin Dupont:
Hi Cafe!
I'm looking for how to extract the exposed modules (as a list of
strings) from an installed library, giving the library name.
I can see some structures in Cabal (InstalledPackageInfo) and some
functions in
Hi,
Am Samstag, den 16.03.2013, 05:53 -0700 schrieb John Meacham:
On Sat, Mar 16, 2013 at 5:28 AM, Kiwamu Okabe kiw...@debian.or.jp wrote:
We are happy to announce Ajhc 0.8.0.2.
I have merged your changes back into the main jhc tree. Thanks!
John
Great. Would it be possible for you two
Hi,
Am Dienstag, den 26.02.2013, 10:25 +0100 schrieb Andreas Abel:
To your amusement, I found the following in the Agda source:
abstractToConcreteCtx :: ToConcrete a c = Precedence - a - TCM c
abstractToConcreteCtx ctx x = do
scope - getScope
let scope' = scope { scopePrecedence =
Hi,
Am Sonntag, den 24.02.2013, 18:41 + schrieb Tom Ellis:
On Sun, Feb 24, 2013 at 07:12:24PM +0100, Joachim Breitner wrote:
You should try:
million :: () - Int
million _ = 10 ^ (6 :: Int)
many :: () - [Int]
many x = [1..million x]
Thanks Joachim, but that doesn't work
Hi,
Am Montag, den 25.02.2013, 08:06 +0200 schrieb Michael Snoyman:
Quite a while back, Simon Hengel and I put together a proposal[1] for
a new feature in GHC. The basic idea is pretty simple: provide a new
pragma that could be used like so:
error :: String - a
errorLoc :: IO Location -
Hi,
Am Montag, den 25.02.2013, 10:13 +0100 schrieb Simon Hengel:
On Mon, Feb 25, 2013 at 09:57:04AM +0100, Joachim Breitner wrote:
Hi,
Am Montag, den 25.02.2013, 08:06 +0200 schrieb Michael Snoyman:
Quite a while back, Simon Hengel and I put together a proposal[1] for
a new feature
Hi,
I believe, without checking, that
Am Sonntag, den 24.02.2013, 17:49 + schrieb Tom Ellis:
many :: () - [Int]
many () = [1..million]
is indeed called many times. The problem is that [1..million] is not
dependent on the parameter, so GHC will float it out to a top level
declaration, and
Hi,
Am Dienstag, den 12.02.2013, 17:47 -0500 schrieb Nehal Patel:
To me, it seems that something like this should be possible -- am i
being naive? does it already exist? have people tried and given up?
is it just around the corner? can you help me make sense of all of
this?
a related
Hi,
that’s no surprise:
“ARM support in the RTS linker (#5839) has been implemented.”
(http://www.haskell.org/ghc/docs/7.4.2/html/users_guide/release-7-4-2.html)
Greetings,
Joachim
Am Mittwoch, den 06.02.2013, 18:21 -0500 schrieb dude:
I have also validated ghc 7.4.1 on the Ubuntu Precise
Hi,
Am Mittwoch, den 30.01.2013, 15:07 -0800 schrieb Edward Z. Yang:
Nevertheless, I believe we are in violent agreement that
cryptographically signed Hackage packages should happen as soon as
possible!
I don’t think we need hackage support here. Just add a MD5-Sum: field
to the .cabal file
Hi,
Am Mittwoch, den 30.01.2013, 11:27 -0800 schrieb Edward Z. Yang:
https://status.heroku.com/incidents/489
Unsigned Hackage packages are a ticking time bomb.
another reason why Cabal is no package manager¹.
(Ok, I admit that I don’t review every line of diff between the Haskell
packages I
Hi,
Am Mittwoch, den 30.01.2013, 14:43 -0800 schrieb Edward Z. Yang:
Excerpts from Joachim Breitner's message of Wed Jan 30 12:59:48 -0800 2013:
another reason why Cabal is no package manager¹.
Based on the linked post, it seems that you are arguing that cabal-install is
not a package
Hi,
Am Sonntag, den 20.01.2013, 17:21 +0100 schrieb Vincent Hanquez:
On Sun, Jan 20, 2013 at 11:01:22AM +0100, Joachim Breitner wrote:
Debian ships tls-extras 0.4.6 in what will become wheezy, and due to the
freeze upgrading to a new major upstream release is not acceptable.
Would
Dear list,
with rewrite rules I can tell the compiler to replace map id by id,
but I still have to write that rule by hand.
Does anyone of you know about research into inferring such a rewrite
rule automatically? I could imagine that for a function of type f ::
some - args - T a - T b and
Hi,
Am Sonntag, den 20.01.2013, 06:50 +0100 schrieb Vincent Hanquez:
this is a security advisory for tls-extra 0.6.1 which are all vulnerable to
bad
certificate validation.
Some part of the certificate validation procedure were missing (relying on the
work-in-progress x509 v3
Hi,
Am Sonntag, den 13.01.2013, 07:34 -0800 schrieb Bob Ippolito:
I think it's more complicated because he doesn't know what the return
type or arity of the function is. In QuickCheck they know the return
type of a property is Bool. In this case, we only know that the return
type is an
Hi,
Am Freitag, den 11.01.2013, 23:55 +0100 schrieb Vincent Hanquez:
I've recently released crypto-pubkey [1][2], which provide a comprehensive
solution for public key cryptography.
Most known RSA modes (PKCS15, OAEP, PSS) are supported, and there's also DSA
and ElGamal signature support.
Hi Erik,
Am Mittwoch, den 09.01.2013, 14:23 +0100 schrieb Erik Hesselink:
We've also used this approach to debug space-leaks, and would have
loved such a tool. We used deepseq, and compared the heap profiles. We
finally found the leaks this way, and fixed them using strictness
annotations.
Hi,
Am Mittwoch, den 09.01.2013, 15:11 +0100 schrieb Erik Hesselink:
We finally solved the problems by completely moving
to strict map operations, strict MVar/TVar operations, and strict data
types.
do you mean strict by policy (i.e. before storing something in a
[MT]Var, you ensure it is
make the analysis much easier?
Thanks,
Joachim
--
Joachim Breitner
e-Mail: m...@joachim-breitner.de
Homepage: http://www.joachim-breitner.de
Jabber-ID: nome...@joachim-breitner.de
signature.asc
Description: This is a digitally signed message part
Dear Haskellers,
I’m wondering if the use of deepseq to avoid unwanted lazyness might be
a too large hammer in some use cases. Therefore, I’m looking for real
world programs with ample use of deepseq, and ideally easy ways to test
performance (so preferably no GUI applications).
I’ll try to find
Hi,
Am Montag, den 07.01.2013, 13:06 +0100 schrieb Joachim Breitner:
I’m wondering if the use of deepseq to avoid unwanted lazyness might be
a too large hammer in some use cases. Therefore, I’m looking for real
world programs with ample use of deepseq, and ideally easy ways to test
performance
Hi,
Am Dienstag, den 25.12.2012, 16:58 +0100 schrieb Thomas Schilling:
On 21 December 2012 11:16, Joachim Breitner m...@joachim-breitner.de wrote:
Prelude :script /home/jojo/.cabal/share/ghc-heap-view-0.4.0.0/ghci
Prelude let x = [1..10]
Prelude x
[1,2,3,4,5,6,7,8,9,10]
Prelude
Dear Michael,
I’m wondering if I missed something, but is there a mailing list for
stackage? Or has one of the standard lists (-cafe, libraries) been
designated for questions about stackage?
What I want to know is if you plan to provide a website for stackage
soon where the list of included
Hi,
I get the impression that blogs and planet.haskell.org are the best way
to disseminate information about new tools any more. Maybe a part of the
earlier importance has been taken over by GooglePlus, but not all,
leaving both blogs and GooglePlus less useful individually?
Anyways, I’d like to
Hi,
Am Mittwoch, den 19.12.2012, 12:28 -0500 schrieb Radical:
I see that the comments are from years ago. Are there any ongoing
efforts to expand the default search set?
if Michael Snoyman’s stackage will fly, I’d that would be a good
candidate for a default set.
Greetings,
Joachim
--
Hi,
Am Mittwoch, den 12.12.2012, 02:50 +0100 schrieb Jonathan Fischer
Friberg:
On Wed, Dec 12, 2012 at 2:26 AM, Ramana Kumar
ramana.ku...@cl.cam.ac.uk wrote:
Using the GPL (or a strong copyleft free license) strengthens
the free software community of which I thought the
fiddling around.
Greetings,
Joachim
--
Joachim Breitner
e-Mail: m...@joachim-breitner.de
Homepage: http://www.joachim-breitner.de
Jabber-ID: nome...@joachim-breitner.de
signature.asc
Description: This is a digitally signed message part
___
Haskell
the code if you add some feature to your language,
making it a bit more expressive. Then your core language will be more
than just a subset of Haskell.
As you can see, you will have a hard time preventing yourself from
introducing a core language.
Greetings,
Joachim
--
Joachim Breitner
e-Mail: m
they had a reason for doing it that way
On Thu, Nov 8, 2012 at 2:02 PM, Joachim Breitner
m...@joachim-breitner.de wrote:
Hi David,
your pretty-class package
Hi,
Am Montag, den 05.11.2012, 23:34 +0100 schrieb Peter Divianszky:
Good remark, this can be solved with weak pointers, although I don't
know how efficient they are.
--
The next version of the proposal
Replace every record update
r' = r { x = y }
with
Hi,
Am Samstag, den 03.11.2012, 11:26 +0100 schrieb Peter Divianszky:
This can be implemented by replacing every record update
r' = r { x = y }
with
r' = r { x = unsafePerformIO (cond-update r r' (x r) y) }
where we keep the current record update mechanism and implement
Hi Henning,
Am Mittwoch, den 03.10.2012, 19:52 +0200 schrieb Henning Thielemann:
I wondered whether there is a brilliant typing technique that makes
Data.Map.! a total function. That is, is it possible to give (!) a type,
such that m!k expects a proof that the key k is actually present in
Hi,
Am Montag, den 03.09.2012, 18:31 +0200 schrieb Harald Bögeholz:
I would greatly appreciate advice from experienced Haskellers why this
has happened. The program is hosted on github; this is the direct link
to the change with unexpected outcome:
make use of my code in Lambdachine I’d be very happy to help
fixing bus and to hear about your results (but from a first glance it
seems that you are not using that part of GHC in your project, right?).
Greetings,
Joachim
--
Dipl.-Math. Dipl.-Inform. Joachim Breitner
Wissenschaftlicher
, GHC would yield good code even
without `seq`).
In this case (which is actually the benchmarked case), reordering or
strictness annotations do not help.
Greetings and sorry for the confusion,
Joachim
--
Dipl.-Math. Dipl.-Inform. Joachim Breitner
Wissenschaftlicher Mitarbeiter
http://pp.info.uni
to be stored, but here
it cannot be done just by inlining or macro expansion.
Greetings,
Joachim
--
Dipl.-Math. Dipl.-Inform. Joachim Breitner
Wissenschaftlicher Mitarbeiter
http://pp.info.uni-karlsruhe.de/~breitner
signature.asc
Description: This is a digitally signed message part
.-Inform. Joachim Breitner
Wissenschaftlicher Mitarbeiter
http://pp.info.uni-karlsruhe.de/~breitner
signature.asc
Description: This is a digitally signed message part
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
Hi,
Am Montag, den 27.08.2012, 18:20 +0200 schrieb Alberto G. Corona :
For a caching library, I need to know the runtime usage of memory of
the program and the total amount of memory, the total memory used by
all the programs etc.
I need not do profiling or monitoring but to do
on?
maybe you get some ideas from my talk at GNUnify ’11, which is roughly
the same that I blogged about at
http://www.joachim-breitner.de/blog/archives/461-Haskell-Demonstration-at-IIT-Bombay.html
But it is less an introduction and more a demonstration.
Greetings,
Joachim
--
Joachim Breitner
instance for empty data types are
strict:
Prelude data V
Prelude :set -XStandaloneDeriving
Prelude deriving instance Eq V
Prelude (error 1 :: V) == (error 2 :: V)
*** Exception: Void ==
Greetings,
Joachim
--
Joachim Breitner
e-Mail: m...@joachim-breitner.de
Homepage: http://www.joachim
Hi,
Am Mittwoch, den 04.07.2012, 21:10 +1000 schrieb Ivan Lazar Miljenovic:
So what's going on here?
you are likely hit by
http://hackage.haskell.org/trac/ghc/ticket/5989
Greetings,
Joachim
--
Joachim nomeata Breitner
m...@joachim-breitner.de | nome...@debian.org | GPG: 0x4743206C
Hi,
another related package seems to be my ghc-heap-view package, which is a
bit lower level than vaccuum, as it does not try to build a consistent
graph image but rather be more verbose about the heap objects, in
particular about closures referenced by thunks:
Hi,
Am Montag, den 14.05.2012, 07:21 -0700 schrieb Simon Michael:
I wonder how to simplify the graph further. Perhaps just the dependencies of
tags would be interesting in some repos ?
I think you’d want to collapse [a]→[b] to [a,b], if no other edges leave
a or reach b. This way you only get
-Concurrent-STM-Stats.html#v:trackThisSTM
(and its source) for one example. One would use this approach maybe with
http://hackage.haskell.org/packages/archive/safe/0.3.3/doc/html/Safe.html#v:headNote
Greetings,
Joachim
--
Joachim Breitner
e-Mail: m...@joachim-breitner.de
Homepage: http
Hi Michael,
Am Mittwoch, den 18.04.2012, 19:21 +0300 schrieb Michael Snoyman:
I'm quite a novice at rewrite rules; can anyone recommend an approach
to get my rule to fire first?
I’m not an expert of rewrite rules either, but from some experimentation
and reading -dverbose-core2core (which is
Hi,
Am Dienstag, den 10.04.2012, 11:00 +0200 schrieb Yves Parès:
Plus, I believed some had used GHC for smartphones?
do you refer to
http://www.joachim-breitner.de/blog/archives/300-Xmonad-on-my-mobile-phone.html
or something more serious?
Greetings,
Joachim
--
Joachim nomeata Breitner
Hi,
Am Dienstag, den 10.04.2012, 12:36 +0200 schrieb Yves Parès:
For instance, yes.
I think I had seen some times on this mailing list or on blog posts
(http://ghcarm.wordpress.com/) people having used GHC on ARM platform.
I distinctly remember having seen on the mailing list that
Joey refers to. But maybe also that ARM machines
tend to be slower :-)
I’m happily running git-annex on a NSLU2 (266MHz/23MB RAM ARM NAS
device) and have done so before it was registerized, so it is definitely
a useful target for Haskell.
Greetings,
Joachim
--
Joachim Breitner
e-Mail: m
Dear Cabal authors,
if your package is team maintained and you put in a mailing list as the
“Maintainer” contact of your package, that is in general a good thing.
But if you do so, please make sure the list is not set to subscriber
only; it is an unreasonable burden to subscribe for people who
Hi,
Am Dienstag, den 20.03.2012, 18:40 +0100 schrieb Simon Hengel:
Do you see a way that you could incorporate distribution information?
I thought it would be nice to have a second table that correlates
Platform versions with distro releases, because I think this is relevant
to package
Hi,
Am Sonntag, den 18.03.2012, 10:08 +0100 schrieb Simon Hengel:
I compiled a chart that gives a side-by-side comparison of package
versions in various Haskell Platform releases.
http://sol.github.com/haskell-platform-versions-comparison-chart/
This includes both, packages that come
Hi,
Am Freitag, den 16.03.2012, 21:00 +1100 schrieb Erik de Castro Lopo:
With a base system with just ghc and cabal-install, if I try to install
bytestring-lexing I get:
$ cabal install bytestring-lexing
Resolving dependencies...
Configuring bytestring-lexing-0.4.0...
Hi,
Am Samstag, den 10.03.2012, 15:50 -0300 schrieb Thiago Negri:
I see. Thanks for the answers.
Any data structure or source annotation that would prevent that?
For example, if I try the same program to run on a
[1..] list, I'll get an out of memory error for the
Hi Sönke,
Am Freitag, den 09.03.2012, 11:17 +0100 schrieb Sönke Hahn:
Any comments welcome.
you could elaborate the documenatation “Assumes UTF-8” – I guess this
only applies to the two ByteString variants, as String and Text _should_
contain unicode codepoints and no encoding. Not that someone
Hi,
Am Freitag, den 09.03.2012, 13:44 +0200 schrieb Michael Snoyman:
On Fri, Mar 9, 2012 at 1:40 PM, Joachim Breitner
m...@joachim-breitner.de wrote:
I was about to suggest to merge this into the convertible package (to
fight package proliferation), but found that it seems it is already
Hi,
Am Freitag, den 09.03.2012, 13:44 +0200 schrieb Michael Snoyman:
On Fri, Mar 9, 2012 at 1:40 PM, Joachim Breitner
m...@joachim-breitner.de wrote:
I was about to suggest to merge this into the convertible package (to
fight package proliferation), but found that it seems it is already
Hi,
Am Freitag, den 10.02.2012, 18:21 +0100 schrieb Morten Olsen lysgaard:
I tried with:
ghc --make -static -rtsopts=all -optl-pthread -optl-static Program.hs
When I copy the binary created over to my x86_64 Ubuntu 11.10 desktop
and run it I get:
Program: mkTextEncoding: invalid argument
Hi,
Am Donnerstag, den 09.02.2012, 11:39 + schrieb Chris Dornan:
(I do think that we could be delivering the tools with a little more
packaging that could significantly help with these situations. I have
found them to be highly useful in any case.)
if you are content with not always
Hi,
Am Montag, den 30.01.2012, 10:52 +0100 schrieb Alexander Bernauer:
On Sun, Jan 29, 2012 at 11:25:09PM +0100, Ertugrul Söylemez wrote:
First of all, /learning/ to optimize Haskell can be difficult. The
optimizing itself is actually fairly easy in my experience, once you
understand how
Hi,
Am Samstag, den 28.01.2012, 23:34 -0500 schrieb wren ng thornton:
* Perhaps the most useful is that it packages up Matt Helige's classic
multicomposition trick[1]. These combinators allow you to easily modify
the types of a many-argument function with syntax that looks like giving
type
Hi,
Am Mittwoch, den 18.01.2012, 12:05 -0800 schrieb Conal Elliott:
Has anyone implemented pattern-matching substitution for
haskell-src-exts? - Conal
without checking the code, I believe that hlint does exactly that; it
takes rules (given as Haskell code), matches them as patterns against
Hi,
a Debian user tried to report a bug against cabal-install
(http://bugs.debian.org/655752) but the trac instance linked from the
Cabal homepage seems to be down:
http://hackage.haskell.org/trac/hackage/
Internal Server Error
TracError: IOError: [Errno 13] Permission denied:
Hi,
Am Mittwoch, den 21.12.2011, 19:15 +1000 schrieb Gregory Crosswhite:
I don't have any tips for cleaning up the code off the top of my head,
but I suspect that the memory leak is coming from the fact that the
expression (v+1) is not being forced, which means that each iteration
of the
Dear Wren,
Am Mittwoch, den 21.12.2011, 13:04 -0500 schrieb wren ng thornton:
On 12/21/11 4:31 AM, Joachim Breitner wrote:
This would be particularly handy when with, for example
snd tuple `evaluateUntilItDoesNotNeed` tuple
where the tuple is unevaluated in the right component
Hi,
Am Samstag, den 17.12.2011, 20:42 +0100 schrieb Gary Klindt:
That compiles fine, but the GUI never shows a neues label!.
blind guess: Do you need to call widgetShow on the newly created widget?
Greetings,
Joachim
--
Joachim nomeata Breitner
m...@joachim-breitner.de |
instead of 2.3.0.5
You can always check the various platform package versions available in
Debian stable (“squeeze”), testing (“wheezy”) and unstable (“sid”) on
http://people.debian.org/~nomeata/platform.html
On behalf of the Debian Haskell Group,
Joachim Breitner
--
Joachim nomeata Breitner
Debian
Hi,
I will attend the CRA-W/CDC/SIGPLAN Mentoring Workshop at POPL next
year, and will have to share a room with another attendee. As we can
give preferences, I was wondering if another Haskeller might be in the
same position and interested in sharing a room.
Greetings,
Joachim
--
Joachim
Hi,
Am Samstag, den 03.12.2011, 16:18 +1100 schrieb Erik de Castro Lopo:
I'm working on a literate haskell document (actually TeX, but the
example below is just test) and I'm using ByteStrings in the code.
I know I can do:
ghci -XOverloadedStrings file.lhs
or, after ghci is running I
Dear Cafe,
I’m trying to exploit list fusion as provided by GHC (build/foldr). One
function that I want to get fusable is this, it splits a list of
integeres into maximal monotonous subsequences:
streaks :: [Integer] - [[Integer]]
streaks [] = []
streaks (x:xs) = let (this,rest) = oneStreak
Hi,
Am Donnerstag, den 01.12.2011, 11:28 +0100 schrieb Joachim Breitner:
Now I’d like to implement streaks in terms of build and foldr such that
it is subject to list fusion.
one half of the task is quite doable:
streaks' :: [Integer] - [[Integer]]
streaks' xs = foldr streaksF
Hi again,
Am Donnerstag, den 01.12.2011, 11:38 +0100 schrieb Joachim Breitner:
Am Donnerstag, den 01.12.2011, 11:28 +0100 schrieb Joachim Breitner:
Now I’d like to implement streaks in terms of build and foldr such that
it is subject to list fusion.
one half of the task is quite doable
Hi,
Am Donnerstag, den 01.12.2011, 21:44 +0100 schrieb Joachim Breitner:
Does ghc treat list comprehensions differently here?
I could answer this by looking at compiler/deSugar/DsListComp.lhs in the
GHC source:
List comprehensions may be desugared in one of two ways:
``ordinary
Hi,
Am Donnerstag, den 01.12.2011, 22:16 +0100 schrieb Joachim Breitner:
This would motivate the following definition for a fusionable concatMap,
going via list comprehensions and their translation to ideal list fusion
consumers/producers:
concatMap f xs
== [ y | x - xs, y - f x
Hi,
Am Dienstag, den 29.11.2011, 07:43 +0200 schrieb Michael Snoyman:
Since the release of deepseq 1.2, we've had a bit of a problem: when
using the newest versions of packages on Hackage, there is no NFData
instance available for the containers types. When GHC 7.4 comes out
with its newer
Hi,
Am Dienstag, den 29.11.2011, 10:36 +0200 schrieb Michael Snoyman:
On Tue, Nov 29, 2011 at 10:29 AM, Joachim Breitner
m...@joachim-breitner.de wrote:
Am Dienstag, den 29.11.2011, 07:43 +0200 schrieb Michael Snoyman:
Since the release of deepseq 1.2, we've had a bit of a problem: when
Hi,
Am Donnerstag, den 10.11.2011, 01:35 +0200 schrieb Artyom Kazak:
Anyway, I have to say it once again: unsafeAt is ugly and Haskell is
beautiful. Why high-performance code should be ugly?
It does not have to be ugly. Just write
(!!) = unsafeAt
in some common module of yours, and
Hi,
Am Samstag, den 05.11.2011, 16:21 +0100 schrieb Daniel Fischer:
On Saturday 05 November 2011, 16:00:40, Ivan Lazar Miljenovic wrote:
On 6 November 2011 01:52, Victor Miller victorsmil...@gmail.com wrote:
Lately whenever I try to install a cabal package it fails with the
following
Hi,
Am Mittwoch, den 26.10.2011, 13:10 +1100 schrieb Ivan Lazar Miljenovic:
How did you get your ghc?
If from your distro's package manager, you should be able to get the dyn-
libs from that too.
Unless you distro hasn't built GHC with dynamic library support.
Debian (and in extension,
Hi,
Am Donnerstag, den 20.10.2011, 23:10 +0200 schrieb Ertugrul Soeylemez:
In general you should try to work with immutable vectors as much as
possible. Done properly you shouldn't lose much performance that way.
However, sometimes an operation is just much easier to express and
faster
Hi,
I’m consdering to change some performance critical code from Vector to
MVector, hopefully avoiding a lot of copying and garbage collecting. But
it seems that the Data.Vector.Mutable interface at
http://hackage.haskell.org/packages/archive/vector/0.9/doc/html/Data-Vector-Mutable.html
is
1 - 100 of 296 matches
Mail list logo
