Hi,
I am currently working on benchmarking the pretty library.
Pretty itself has no non-trivial dependencies. But criterion and
language-c, which I use to perform the benchmarks, directly and/or
indirectly depend on pretty. Everything is configured in one Cabal file via
library and benchmark
On 14 February 2013 13:11, Alexander Bernauer acop...@gmail.com wrote:
Hi,
I am currently working on benchmarking the pretty library.
... skip ...
What is the right way to handle this scenario?
I simply create symlink to source tree and build benchmark with ghc --make ...
On 14 February 2013 20:56, Gregory Collins g...@gregorycollins.net wrote:
While you're benchmarking, rename the library under test and/or its modules.
Criterion won't conflict with new-pretty.
Alternatively, don't ever actually install your new pretty and just do
cabal configure
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
I have to agree that reading and maintaining regular expressions can be
challenging :)
On Wed, Feb 13, 2013 at 9:50 PM, Erik de Castro Lopo
mle...@mega-nerd.comwrote:
wren ng thornton wrote:
Regexes are powerful and concise for recognizing regular languages. They
are not, however, very
Just to play devil's advocate:
100% agreed that there are better things to do in Haskell _source code_ than
regexps.
The thing about regexps is that they can be accepted at run time as _data_.
This means, for example, that they can be put in whatever you use for
localisation.
See for
On 2/13/13 11:18 PM, wren ng thornton wrote:
On 2/13/13 11:32 AM, Nicolas Bock wrote:
Since I have very little experience with Haskell and am not used to
Haskell-think yet, I don't quite understand your statement that
regexes are
seen as foreign to Haskell-think. Could you elaborate? What would
(I'll be brief because my head is hurting, but please don't interpret that
as an intent to offend)
A few points:
1) Capture groups are all you need to do some meaningful interpretation of
data; these were around long before perl.
2) Yacc is typically used in conjunction with lex, partly for (a)
It's worth remembering that the main gain from lex/yacc had originally to do
with making the generated programs fit into 64K address space on a PDP11 more
than with any direct performance efficiency.
--
brandon s allbery kf8nh
Sent with Sparrow (http://www.sparrowmailapp.com/?sig)
On
Please see
http://pyfound.blogspot.in/2013/02/python-trademark-at-risk-in-europe-we.html
I cannot say that I understand whats really going on
The one thing that I get is that there was some minor neglect a decade or
more ago.
http://blog.languager.orgMaybe there are things that Haskell needs to
Hi,
I was puzzled by the following little program.
sum' [] = []
sum' (x:xs) = x + sum' xs
I thought the GHC type checker will report a type error. However, the type
checker accepts this program and gives the type
Num [a] = [[a]] - [a]
When I add type annotation to the program
sum' :: Num [a]
sum' [] = [] -- returns a list of something the way you intended
sum' (x:xs) = x + xum' xs -- you intended it not to return a list but it
could if you think about it.
The compiler says I think returns a list based on what I see so far, well
if you can add these together then the only way you
12 matches
Mail list logo
