place?
Cheers,
- Ben
pgppP5lQOaZx3.pgp
Description: PGP signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of new syntax
* there are arguably few uses for such a mechanism beyond exporting TH
constructs
* you still have the work of solving the issues presented in #1475
Anyways, just a thought.
Cheers,
- Ben
[1] http://ghc.haskell.org/trac/ghc/ticket/1475
pgpoddlH92BBj.pgp
Description: PGP
Roman Cheplyaka r...@ro-che.info writes:
* Ben Gamari bgamari.f...@gmail.com [2013-09-17 10:03:41-0400]
Another approach might be to introduce some notion of a name list which
can appear in the export list. These lists could be built up by either
user declarations in the source module
isn't this what zippers are for?
b
On Aug 30, 2013, at 1:04 PM, Clark Gaebel wrote:
I don't think a really smart compiler can make that transformation. It looks
like an exponential-time algorithm would be required, but I can't prove that.
GHC definitely won't...
For this specific
) []
Probably an instance of this one:
http://ghc.haskell.org/trac/ghc/ticket/5550
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
This is partially guesswork, but the code to catchWSError looks dubious:
catchWsError :: WebSockets p a
- (SomeException - WebSockets p a) -
WebSockets p a catchWsError act c = WebSockets $ do env - ask
let it = peelWebSockets env $ act cit =
That's not a GHC flag; it's a haddock flag. Haddock (which, in case you're
not familiar with it, is a program to generate documentation from Haskell
source code) uses GHC, and the `optghc` flag lets you pass options to GHC
when you invoke Haddock. See [the Haddock docs of the 6.12 era][1], on page
unanswered, but I'd give
the idiomatic approach a bit more time before trying to coerce C into
Haskell. Profile, see where the hotspots are and optimize
appropriately. If the profile has you flummoxed, the lists and #haskell
are always willing to help given the time.
Cheers,
- Ben
on how it is to be run.
best, b
On Jun 25, 2013, at 1:03 PM, Ben wrote:
hello cafe --
by now i'm sure you have heard that the homotopy type theory folks have just
written up a free introductory book on their project.
http://homotopytypetheory.org/2013/06/20/the-hott-book/
gabriel
, ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ByteString is, as the
name suggests, a string of bytes, Text is a string of characters in a
Unicode encoding. When you are talking about unstructured binary data,
you should most certainly be using ByteString.
Cheers,
- Ben
___
Haskell-Cafe mailing list
On Tue, May 28, 2013 at 1:54 AM, Dominique Devriese
dominique.devri...@cs.kuleuven.be wrote:
Hi all,
I often find myself needing the following definitions:
mapPair :: (a - b) - (c - d) - (a,c) - (b,d)
mapPair f g (x,y) = (f x, g y)
mapFst :: (a - b) - (a,c) - (b,c)
mapFst f =
On Thu, May 30, 2013 at 7:12 PM, Shachaf Ben-Kiki shac...@gmail.com wrote:
One generalization of them is to lenses. For example `lens` has
both, _1, _2, such that mapPair = over both, mapFst = over
_1, etc., but you can also get fst = view _1, set _2 = \y' (x,_)
- (x,y'), and so on. (Since
and failed.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Helium seems interesting, but the code is a little stale, no? The last
updates seem to be from 2008-2009. I couldn't get it to build with ghc
7.6.3, not that I tried too terribly hard.
On Tue, May 21, 2013 at 6:07 AM, Andrew Butterfield
andrew.butterfi...@scss.tcd.ie wrote:
Rustom,
you
You might want to check out
FPCompletehttps://www.fpcomplete.com/page/about-us,
if you haven't already. They're far more focused on making it easy for
organizations to adopt Haskell than the community can be. As they say: Where
the open-source process is not sufficient to meet commercial adoption
mercenaries.
On Sat, May 4, 2013 at 2:03 PM, Carter Schonwald carter.schonw...@gmail.com
wrote:
What pray tell are those missing pieces? Aren't they mostly building a
browser based ide plus doing training courses ?
On May 4, 2013 1:42 PM, Ben Doyle benjamin.peter.do...@gmail.com
wrote:
You
it'd be a helpful pointer to
whomever is working on new haddock -- they are of course welcome to ignore it.
totally understand that overmuch debate is not helpful (though i'm not sure
it's fair to call it bikeshedding, since it is a primary feature of the
proposed project!)
best, ben
On Apr
alternative.
http://asciidoc.org/
http://asciidoctor.org/docs/what-is-asciidoc-why-use-it/
best, ben
On Apr 27, 2013, at 11:06 AM, Bryan O'Sullivan wrote:
On Sat, Apr 27, 2013 at 2:23 AM, Alistair Bayley alist...@abayley.org wrote:
How's about Creole?
http://wikicreole.org/
Found it via
the approach that Ben is
talking about. As Ben says, intuitively the problem is that when you've
got multiple outputs so you need to make sure that someone is consuming
them and that that consumption is appropriately synchronised so that you
don't have to buffer (buffering would almost certainly
On 26/04/2013, at 2:15 PM, Johan Tibell wrote:
Hi Ben,
On Thu, Apr 25, 2013 at 7:46 PM, Ben Lippmeier b...@ouroborus.net wrote:
The Repa plugin will also do proper SIMD vectorisation for stream programs,
producing the SIMD primops that Geoff recently added. Along the way
. Splitting multiple operators this way and then merging
the parts into a single loop provides the concurrency required by the
description in John Hughes's thesis.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
and it will form the basis of Repa 4,
which I'm hoping to finish a paper about for the upcoming Haskell Symposium.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
The contribution of the HS paper is planning to be:
1) How to extend the approach to the combinators we need for DPH
2) How to package it nicely into a Haskell library.
I'm still working on the above...
Ben.
___
Haskell-Cafe mailing list
Haskell
(e.g. HMatrix) to perform the inversion (and determinant for proper
normalization). Otherwise, implementing the function given the inverse
is quite straightforward.
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
available in 7.6, allowing one to use type
level naturals, but the type checker is unable to unify arithmetic
operations.
Cheers,
- Ben
[1]
http://hackage.haskell.org/packages/archive/linear/1.1.1/doc/html/Linear-V.html
___
Haskell-Cafe mailing list
, I think Markdown is a fine choice for very much the
same reason. RST has some nice properties (especially for documenting
Python), but Markdown is much more common. Moreover, I've always found
RST's linkification syntax a bit awkward.
Cheers,
- Ben
that's too bad, i used lazy deserialization for an external sort thing i did
aeons ago.
http://www.haskell.org/pipermail/haskell-cafe/2007-July/029156.html
that was an amusing exercise in lazy IO. these days it's probably better off
doing something with pipes et al instead of
but kills my machine, routinely.
i would be willing to mentor, but i'm not an expert enough i think!
best, ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I was trying to figure out a way to write absurd :: (forall p. p Char
- p Bool) - Void using only rank-n types. Someone suggested that
Haskell with RankNTypes and a magic primitive of type (forall p. p
Char - p Bool) might be sound (disregarding the normal ways to get ⊥,
of course).
Is that true?
On 27/02/2013, at 10:28 , Corentin Dupont corentin.dup...@gmail.com wrote:
Hello everybody!
I am very happy to announce the beta release [1] of Nomyx, the only game
where You can change the rules.
Don't forget 1KBWC: http://www.corngolem.com/1kbwc/
Ben
on someone else's
package. But always good to know.
Best of luck,
Ben
[1]:
http://www.haskell.org/ghc/docs/latest/html/users_guide/separate-compilation.html#recomp
[2]:
http://www.haskell.org/ghc/docs/latest/html/users_guide/sooner-faster-quicker.html#sooner
On Mon, Jan 28, 2013 at 4:27 PM, Artyom Kazak artyom.ka...@gmail.com wrote:
Hi!
I’ve always thought that `quotRem` is faster than `quot` + `rem`, since both
`quot` and `rem` are just wrappers that compute both the quotient and the
remainder and then just throw one out. However, today I looked
I think acid-state (http://hackage.haskell.org/package/acid-state) might do
what you want, at least in broad strokes. It uses a durable transaction log
to store query and update events.
As far as I know, the interface to the library doesn't expose an
undo/rollback function, so you'd have a bit of
to have it directly in the repo than on the wiki, that way no-one that
works on the code can miss it.
I suppose I'm the default owner of the register allocators and non-LLVM native
code generators.
Ben.
[1] http://llvm.org/viewvc/llvm-project/llvm/trunk/CODE_OWNERS.TXT?view=markup
On 06/12/2012, at 3:18 , KC wrote:
:)
Not apart from the matrix-matrix multiply code in repa-algorithms. If you
wanted to write some I'd be happy to fold them into repa-algorithms.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
, there is
no return for that in the Map case for exactly the same reason as with
Apply: the unit would have have value id for every possible key, so cannot
be finite.
So what about an example for Bind\\Monad that is not yet another variation
of the finite structure theme?
Cheers
--
Ben Franksen
Brent Yorgey wrote:
On Thu, Nov 29, 2012 at 03:52:58AM +0100, Ben Franksen wrote:
Tony Morris wrote:
As a side note, I think a direct superclass of Functor for Monad is not
a good idea, just sayin'
class Functor f where
fmap :: (a - b) - f a - f b
class Functor f = Apply f
.
GHC is just simply amazing. You guys RULE THE WORLD!
Cheers
--
Ben Franksen
() ascii ribbon campaign - against html e-mail
/\ www.asciiribbon.org - against proprietary attachments
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
should hold
for them.
Cheers
--
Ben Franksen
() ascii ribbon campaign - against html e-mail
/\ www.asciiribbon.org - against proprietary attachments
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
implementations for
= in terms of = and vice versa, so that you can still use = as the
primitive operation when implementing an instance.
Cheers
--
Ben Franksen
() ascii ribbon campaign - against html e-mail
/\ www.asciiribbon.org - against proprietary attachments
appreciate that.
He wasn't at ICFP either. I think SPJ said he was in the middle of writing up
his PhD thesis.
When I was doing mine I was out of circulation for a good 3 months.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
With Don Stewart's blessing
(https://twitter.com/donsbot/status/267060717843279872), I'll be
taking over maintainership of ghc-core, which hasn't been updated
since 2010. I'll release a version with support for GHC 7.6 later
today.
Shachaf
___
Shachaf Ben-Kiki shac...@gmail.com writes:
With Don Stewart's blessing
(https://twitter.com/donsbot/status/267060717843279872), I'll be
taking over maintainership of ghc-core, which hasn't been updated
since 2010. I'll release a version with support for GHC 7.6 later
today.
Thanks! I
.
Cheers
--
Ben Franksen
() ascii ribbon campaign - against html e-mail
/\ www.asciiribbon.org - against proprietary attachments
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of the
options from the data structure used to contain them and doesn't rely on
template haskell (unlike cmdargs). Composing this with configuration
file and environment variable parsing seems like it shouldn't be too
tough.
Cheers,
- Ben
___
Haskell
a look at Debug.Trace.traceEvent and
traceEventIO. I have found these to be a remarkably powerful tool for
understanding parallel performance.
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
on top of the monad-par
Failure occurs in the function
Statistics.Resampling.Bootstrap.bootstrapBCA. However I couldn't trigger
bug with mock data.
Has there been any progress or an official bug report on this?
Cheers,
- Ben
___
Haskell-Cafe mailing
considered implementing these myself but
I doubt that I could write an implementation worthy of using having
relatively little knowledge of this flavor of numerics (stability is a
pain, so I hear).
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell
On Tue, Aug 7, 2012 at 7:04 AM, Dan Burton danburton.em...@gmail.com wrote:
As a side note, since the code base is relatively small, it can also serve
as a simple demonstration of how to use a cabal flag
in conjunction with CPP to selectively include swaths of code
(see Control/Monad/Tardis.hs
On Thu, Jul 12, 2012 at 11:01 AM, Takayuki Muranushi muranu...@gmail.comwrote:
sunPerMars :: [Double]
sunPerMars = (/) $ sunMass * marsMass
Sadly, this gives too many answers, and some of them are wrong because
they assume different Earth mass in calculating Sun and Mars masses,
which led
the project again as a GSoC
project next year. That being said, there is no guarantee that someone
would step up to finish it.
Just my two cents.
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
to convince people so set in their ways?
( Sorry if this is even too off-topic for the cafe. Just needed a place to vent
my frustration at this. )
Cheers,
Ben
[1] https://twitter.com/cwestin63/status/214793627170390018
___
Haskell-Cafe mailing list
Haskell
just to add to the ridiculousness quotient of this conversation
http://web.archive.org/web/20080406183542/http://www.lisperati.com/landoflisp/panel01.html
(i don't know where to find this other than in the web archive.)
ben
On Jun 18, 2012, at 1:44 PM, Christopher Done wrote:
On 18 June 2012
for the wild early-morning assumptions, everyone!
Cheers,
Ben
On Tuesday, 19 June 2012 at 6:43 AM, john melesky wrote:
On Tue, Jun 19, 2012 at 05:59:57AM +1000, Ben Kolera wrote:
Saw this float by in twitter, and it made me a bit sad. Obviously
this is still a large misunderstanding of FP
Am I doing something wrong here?
Well, you're using ghc-6.12 ... :-)
The most recent version of pandoc that Hackage claims to have built with
ghc 6.12 looks to be 1.6. Rolling back that far eliminates the json
dependency entirely, so I think it would solve your issue. Or you could use
the
Joshua Poehls jos...@poehls.me writes:
Hello Ben,
Hello,
Sorry for the latency. I'm currently on vacation in Germany so I haven't
had terribly consistent Internet access.
I've Cc'd haskell-cafe@ as I've been meaning to document my experiences
anyways and your email seems like a good excuse
, which might help [2]
[1]
http://hackage.haskell.org/packages/archive/repa/3.1.4.2/doc/html/Data-Array-Repa-Repr-Vector.html
[2] http://www.cse.unsw.edu.au/~benl/papers/guiding/guiding-Haskell2012-sub.pdf
Ben.
___
Haskell-Cafe mailing list
Haskell
I wonder if you want a typeclass here, rather than a type? A Normal Rule is
pretty much a State Transformer, while a Meta Rule seems like a
higher-order function on Normal Rules[*]. These are different kinds of
things --- and I say kind advisedly --- so perhaps better to define the
specific
instrumentation precludes this route of investigation without time
consuming guessing at how to pare down my test case. It's certainly not
an easy problem.
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
a talk I remember watching a while ago which gave a pretty nice
overview. I can't recall, but I might have been this[2]. Lastly,
profiling now works with multiple capabilities[3].
Cheers,
- Ben
[1] http://www.haskell.org/ghc/docs/7.4.1/html/users_guide/release-7-4-1.html
[2] http://www.youtube.com
the thing you export is
doing than if it is from, say, Org.Epics.PvData.Util. Finally, it gives the
package author an incentive to actually do the refactoring that makes it
obvious where the function belongs to, functionally.
Cheers
Ben
___
Haskell
there is a haskell point
of view on it i'm not grasping which avoids the need for this data structure.
maybe there is a way of writing this as an interpreter or using some existing
monad, like the ST monad?
best, ben
[1] - Frank Huch and Frank Kupke, A High-Level Implementation of Composable
Memory
what to
search for, something like interpreters with environments with heterogeneous
types. i find the circuit-diagram / functional representation the most
interesting, but it seems unfortunately syntactically impossible.
best, ben
___
Haskell-Cafe
.) for the second, right now i'm
wondering if i'm going to have to write a compiler for a little DSL; i'd like
to be able to exploit applicative performance gains generally, and special case
1-CAS.
best, ben
On Apr 6, 2012, at 5:38 AM, Heinrich Apfelmus wrote:
Ben wrote:
perhaps it is too late to suggest
i'm not sure what your email is pointing at. if it is unclear, i understand
the difference between applicative and monadic. i suppose the easy answer to
why applicative can be faster than monadic is that you can give a more
specialized instance declaration. i was just wondering if there was
PM, Ben midfi...@gmail.com wrote:
i'm not sure what your email is pointing at. if it is unclear, i understand
the difference between applicative and monadic. i suppose the easy answer to
why applicative can be faster than monadic is that you can give a more
specialized instance declaration
Paolo Capriotti wrote:
On Mon, Apr 16, 2012 at 10:13 PM, Ben Franksen ben.frank...@online.de
wrote:
(1) What is the reason for the asymmetry in
type Producer b m = Pipe () b m
type Consumer a m = Pipe a Void m
i.e. why does Producer use () for the input? I would expect it to use
Void
use e.g. $ instead, which has the
additional advantage of allowing a symmetric variant for the other direction
i.e. $.
Cheers
Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sun, Apr 15, 2012 at 7:14 PM, Steffen Schuldenzucker
sschuldenzuc...@uni-bonn.de wrote:
On 04/13/2012 10:49 PM, Ben Millwood wrote:
I'm pleased to announce my first genuinely original Hackage package:
notcpp-0.0.1!
http://hackage.haskell.org/package/notcpp
[...]
Why
On 08/04/2012, at 2:41 AM, Dominic Steinitz wrote:
Hi Ben, Chris and Others,
Thanks for your replies and suggestions. All I want to do is invert (well
solve actually) a tridiagonal matrix so upgrading ghc from the version that
comes with the platform seems a bit overkill. I think I
problems. However, you'll need
to upgrade to GHC 7.4 to use it. GHC 7.0.3 is two major releases behind the
current version.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 07/04/2012, at 21:38 , Peter Simons wrote:
Hi Ben,
I've just pushed Repa 3 onto Hackage, which has a much better API
than the older versions, and solves several code fusion problems.
when using the latest version of REPA with GHC 7.4.1, I have trouble
building the repa-examples
perhaps it is too late to suggest things for GSOC --
but stephen tetley on a different thread pointed at aaron turon's work, which
there's a very interesting new concurrency framework he calls reagents which
seems to give the best of all worlds : it is declarative and compositional like
STM,
Ben midfi...@gmail.com writes:
perhaps it is too late to suggest things for GSOC --
but stephen tetley on a different thread pointed at aaron turon's
work, which there's a very interesting new concurrency framework he
calls reagents which seems to give the best of all worlds
I am a student currently interested in participating in Google Summer of
Code. I have a strong interest in Haskell, and a semester's worth of coding
experience in the language. I am a mathematics and cs double major with
only a semester left and I am looking for information regarding what the
serves to allow
the use of mutable state inside of a function while hiding the fact from
the outside world.
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
hackage.haskell.org.
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 14 Feb 2012 02:06:16 +, Duncan Coutts
duncan.cou...@googlemail.com wrote:
On 14 February 2012 01:53, Duncan Coutts duncan.cou...@googlemail.com wrote:
Hi Ben,
snip
Ah, here's the link to my last go at getting people to self-organise.
http://www.haskell.org/pipermail/cabal-devel
explodes
5) After it's agreed that things are stable, eventually swap the
Hackage 1 and 2 instances
This will surely be a non-trivial process but I would be willing to move
things forward.
Cheers,
- Ben
[1] http://www.haskell.org/pipermail/cabal-devel/2012-January/008427.html
http://arstechnica.com/business/news/2012/02/transactional-memory-going-mainstream-with-intel-haswell.ars
would any haskell STM expert care to comment on the possibilities of hardware
acceleration?
best, ben
___
Haskell-Cafe mailing list
Haskell-Cafe
On 10/02/2012, at 6:12 AM, mukesh tiwari wrote:
Hello all
I am trying to install dph-examples on Mac OS X version 10.7.3 but getting
this error. I am using ghc-7.4.1.
This probably isn't DPH specific. Can you compile a hello world program with
-fllvm?
Ben
be calling?
The Gloss graphics library has texture support, and the code for drawing them
is confined to this module:
http://code.ouroborus.net/gloss/gloss-head/gloss/Graphics/Gloss/Internals/Render/Picture.hs
Feel free to steal the code from there.
Ben
of when
the pointer actually becomes unreachable. Because texture memory is a scarce
resource, I wouldn't want to rely on a finaliser to free it -- though I suppose
this depends on what you're doing.
Ben.
[1]
http://www.haskell.org/ghc/docs/latest/html/libraries/haskell2010-1.1.0.1/Foreign
exits.
No guarantee of promptness. Even if the GC knows your pointer is unreachable,
it might choose not to call the finaliser. I think people have been bitten by
this before.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
haven't had a chance to update
the wiki yet. Use -package dph-lifted-vseg to select the backend. You could
also look at the cabal file for the dph-examples package to see what flags we
use when compiling.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe
into a similar issue with a concurrent Gibbs
sampling implmentation I've been working on. Increasing -H fixed the
regression, as expected. I'd be happy to provide data if someone was
interested.
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe
in the language must
have a value. So, what is a value of fix id?
There isn't one!
Bottoms will be the null pointers of the 2010's, you watch.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the superior Haskell solution is
to use algebraic data types, and represent a possibly exceptional integer by
Maybe Int. But then when you inspect a Maybe Int you don't always get an ..
ah.
Would it cause a compiler error?
Depends whether you really wanted an Int or not.
Ben
of infinite loops?
Some would say that non-termination is a computational effect, and I can argue
either way depending on the day of the week.
Of course, the history books show that monads were invented *after* it was
decided that Haskell would be a lazy language. Talk about selection bias.
Ben
-terminating, which is what the halting problem is about. This possibly
non-terminating approach is already used by Coq, Agda and other languages.
Ben.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I am fairly new to haskell, but I really like the emacs haskell mode.
It is a bit strict but it generally does what I want it to.
Unfortunately I can't really compare to the haskell vim mode since I
only did Scala and Perl back when I was a heavy vim user.
The one useful thing that I can add is
A while back I somehow managed to get the domain name, lambda.fm and I am
simply creating this post to get some ideas from the community on what it
could be used for to help the FP community. So tell me what you think.
___
Haskell-Cafe mailing list
.
Cheers
Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
It is, in the sense that you can implement all monads in terms of Cont.
Cheers
Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
can spend a day contemplating and still wonder if I have
_really_ understood it. And doesn't that properly reflect the depth and
richness of Haskell?
Cheers
Ben
On Mon, Nov 21, 2011 at 7:52 AM, Karol Samborski
edv.ka...@gmail.comwrote:
2011/11/21 Karol Samborski edv.ka...@gmail.com:
Hi all
On the whole, the filepath package does an excellent job of providing
basic path manipulation tools, one weakness is the inability to resolve
~/... style POSIX paths. Python implements this with
os.path.expanduser. Perhaps a similar function might be helpful in
filepath?
Cheers,
- Ben
Possible
On Sun, 20 Nov 2011 21:02:30 -0500, Brandon Allbery allber...@gmail.com wrote:
On Sun, Nov 20, 2011 at 20:36, Ben Gamari bgamari.f...@gmail.com wrote:
[Snip]
Although arguably there should be some error checking.
Thanks for the improved implementation. I should have re-read my code
before
bumped to 1.5?
Cheers,
- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,
- Ben
[1] http://hackage.haskell.org/trac/ghc/ticket/5610
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
1 - 100 of 662 matches
Mail list logo
