Hi,
Am Freitag, den 02.07.2010, 12:55 +1000 schrieb Ivan Miljenovic:
This can be resolved by putting the build-depends line in the if
statement (and should maybe put up the top of the executable section
to make it more obvious):
the latter was not possible last time I checked.
Greetings,
On 2 July 2010 16:57, Joachim Breitner m...@joachim-breitner.de wrote:
Am Freitag, den 02.07.2010, 12:55 +1000 schrieb Ivan Miljenovic:
This can be resolved by putting the build-depends line in the if
statement (and should maybe put up the top of the executable section
to make it more
Hi,
Am Freitag, den 02.07.2010, 17:14 +1000 schrieb Ivan Miljenovic:
On 2 July 2010 16:57, Joachim Breitner m...@joachim-breitner.de wrote:
Am Freitag, den 02.07.2010, 12:55 +1000 schrieb Ivan Miljenovic:
This can be resolved by putting the build-depends line in the if
statement (and
On Fri, Jul 02, 2010 at 12:55:03PM +1000, Ivan Miljenovic wrote:
On 1 July 2010 17:25, Vincent Hanquez t...@snarc.org wrote:
The main reason for this library is the lack of incremental api exposed by
current digest libraries, and filling the void about some missing digest
algorithms; Also
Vincent Hanquez t...@snarc.org writes:
On Fri, Jul 02, 2010 at 12:55:03PM +1000, Ivan Miljenovic wrote:
On 1 July 2010 17:25, Vincent Hanquez t...@snarc.org wrote:
The main reason for this library is the lack of incremental api exposed by
current digest libraries, and filling the void about
On Wed, 2010-06-30 at 20:34 +0100, Paul Johnson wrote:
I'm starting to see job adverts mentioning Haskell as a nice to have,
and even in some cases as a technology to work with.
However right now I'm looking at it from the other side. Suppose
someone wants to hire a Haskell developer or
On Fri, Jul 2, 2010 at 12:34 PM, Duncan Coutts dun...@well-typed.comwrote:
When we are done we intend to write up a blog post more details, e.g.
numbers and the range/distribution of experience among candidates. I
hope that will be useful to people who are interested in hiring Haskell
On Fri, Jul 02, 2010 at 08:10:19PM +1000, Ivan Lazar Miljenovic wrote:
i.e.
update : ctx - bytestring - IO ()
becomes:
update : ctx - bytestring - ctx
So you're using explicit state parsing? Any particular reason for not
using the State monad or something like that?
hm, I'm
On Fri, 2010-07-02 at 20:10 +1000, Ivan Lazar Miljenovic wrote:
Vincent Hanquez t...@snarc.org writes:
On Fri, Jul 02, 2010 at 12:55:03PM +1000, Ivan Miljenovic wrote:
On 1 July 2010 17:25, Vincent Hanquez t...@snarc.org wrote:
The main reason for this library is the lack of incremental
Hello Vincent,
it's nice to have such a package. It's going to be very useful for me.
Thank you a lot!
BTW, as a third API type possible in Haskell I suggest making a lazy
ByteString variant. In some places this could well replace the
incremental API and be more natural to use.
Greets,
On Thu, 24 Jun 2010 19:25:35 -0700 (PDT), braver delivera...@gmail.com wrote:
Claus -- cafe5 is pretty much where it's at. You're right, the proggy
was used as the bug finder, actually at cafe3, still using ByteString.
Having translated it from Clojure to Haskell to OCaml, I'm now
debugging
I'm happy to (finally) announce haskell-mode 2.8.0, which can be found at
http://projects.haskell.org/haskellmode-emacs/
This is a feature release. I'll let the changelog speak for itself:
* Minimal indentation support for arrow syntax
* Autolaunch haskell-mode for files starting with
On Fri, Jul 02, 2010 at 02:03:23PM +0200, Ertugrul Soeylemez wrote:
Hello Vincent,
Hello Ertugrul,
it's nice to have such a package. It's going to be very useful for me.
Thank you a lot!
you're welcome.
BTW, as a third API type possible in Haskell I suggest making a lazy
ByteString
Hey Svein,
Any chance of including haskell-align-imports somehow in the next release?
http://gist.github.com/453933 (Re-license it for inclusion however you
wish, I don't care.)
On 2 July 2010 14:27, Svein Ove Aas svein@aas.no wrote:
I'm happy to (finally) announce haskell-mode 2.8.0,
On Fri, Jul 2, 2010 at 2:26 PM, Svein Ove Aas sve...@gmail.com wrote:
I'm happy to (finally) announce haskell-mode 2.8.0, which can be found at
http://projects.haskell.org/haskellmode-emacs/
This is a feature release. I'll let the changelog speak for itself:
* Minimal indentation support
On 2 July 2010 14:45, Svein Ove Aas sve...@gmail.com wrote:
My current project is to rewrite the indenter in haskell, using
haskell-src-exts and such. Aligning imports will probably be trivial
once that is done, but the work of integrating it now would probably
also be wasted.
That sounds
Deniz Dogan deniz.a.m.do...@gmail.com writes:
2010/7/2 Svein Ove Aas sve...@gmail.com:
My current project is to rewrite the indenter in haskell, using
haskell-src-exts and such. [snip]
Why do you want to rewrite the indenter in Haskell? If haskell-mode
has any external dependencies such as
On Wed, Jun 30, 2010 at 3:34 PM, Paul Johnson p...@cogito.org.uk wrote:
I'm starting to see job adverts mentioning Haskell as a nice to have, and
even in some cases as a technology to work with.
However right now I'm looking at it from the other side. Suppose someone
wants to hire a Haskell
Alex Ott alex...@gmail.com writes:
Re
Svein Ove Aas at Fri, 2 Jul 2010 15:36:06 +0200 wrote:
SOA On Fri, Jul 2, 2010 at 3:23 PM, Deniz Dogan deniz.a.m.do...@gmail.com
wrote:
Why do you want to rewrite the indenter in Haskell? If haskell-mode
has any external dependencies such as
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 7/2/10 07:23 , Vincent Hanquez wrote:
I'm not sure exactly what the API would looks like, but I think basically you
would enter/leave the state monad quite frequently in incremental mode,
since the whole point of the incremental api is having
A better test might be if they really understood Applicative and
Traversable, or if they knew how to use hsc2hs; Talk about unboxing and when
to apply strictness annotations, finger trees, stream fusion, purely
functional data structures or ways to implement memoization in a purely
functional
Hi Corentin,
Interesting. Have you thought about following the example of XMonad instead?
The analogy could goes as follows:
XMonad's configuration file (~/.xmonad/xmonad.hs) = Your rules.
XMonad's state = Your state.
Editing the config file = Changing the rules.
Of course you normally edit
Hi,
I have been trying to use the State monad for concurrent applications
and came up with a little library.[1] My MState uses an IORef to
maintain the state between different threads. The library also offers a
simple way to fork off new threads using its own forkM function. This
function
Edward Kmett wrote:
Knowledge of Haskell means very different things to different
people. I'd be somewhat leery of blindly hiring someone based on their
ability to answer a couple of pop Haskell quiz questions.
A better test might be if they really understood Applicative and
Traversable, or
class C a b | a-b where
op :: a - b
instance C Int Bool where
op n = n0
data T a where
T1 :: T a
T2 :: T Int
-- Does this typecheck?
f :: C a b = T a - Bool
f T1 = True
f T2 = op 3
The function f should typecheck because inside the T2 branch we know
that
On Fri, Jul 02, 2010 at 06:03:31PM +0100, Andrew Coppin wrote:
Edward Kmett wrote:
Knowledge of Haskell means very different things to different
people. I'd be somewhat leery of blindly hiring someone based on
their ability to answer a couple of pop Haskell quiz questions.
A better test
Maybe the codebase he's hiring for makes heavy use of Applicative,
Traversable, unboxing etc.
-deech
On Fri, Jul 2, 2010 at 12:03 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Edward Kmett wrote:
Knowledge of Haskell means very different things to different people.
I'd be somewhat
Howdy,
The listed maintainer for gd is no longer maintaining it. I'm wondering if
anyone else is, if there is a version control URL, and how I can send
patches. I need to get it working for Win32.
Thanks
___
Haskell-Cafe mailing list
On Fri, Jul 2, 2010 at 9:21 AM, Nils Schweinsberg m...@n-sch.de wrote:
Hi,
I have been trying to use the State monad for concurrent applications and
came up with a little library.[1] My MState uses an IORef to maintain the
state between different threads. The library also offers a simple way
I'll be the new maintainer. I've used it a fair bit. I'll setup a
github repository.
I don't have a Windows install available, but I've used Windows for
development in the past.
Hold up.
On 2 July 2010 20:00, Jason Felice jason.m.fel...@gmail.com wrote:
Howdy,
The listed maintainer for gd is
On 7/2/10, Christopher Done chrisd...@googlemail.com wrote:
On 2 July 2010 20:00, Jason Felice jason.m.fel...@gmail.com wrote:
Howdy,
The listed maintainer for gd is no longer maintaining it. I'm wondering
if
anyone else is, if there is a version control URL, and how I can send
patches. I
Luke Palmer wrote:
I would just use List. IIRC the derivative of list is:
data DList a = DLIst [a] [a]
Understood as the elements before the focused one and those after it.
Unfortunately I can't remember how that is derived, and my own
experiments failed to come up with anything similar.
On Fri, Jul 02, 2010 at 08:10:19PM +1000, Ivan Lazar Miljenovic wrote:
The few existing packages that exposes the incremental API, usually do it
in the IO monad; cryptohash do it purely, creating a new context as it get
updated.
(this has a cost but remains fast globally with the C
Sergey Mironov wrote:
Hello list!
I am trying to understand zipper concept using papers like [1] and [2].
Though main idea looks clear, I still have a problem in applying it for
custom data types.
Please help me with deriving Zipper-type from
data DTree a = P | D [(a, DTree)]
Looking in [1]
On 2 July 2010 20:29, Matthew Gruen wikigraceno...@gmail.com wrote:
I was wondering the same thing about submitting patches to expose more
of the image functionality, including getting some functions to return
Either instead of failing with a runtime error. Let me know when you
get it set up.
On 02.07.2010 20:05, Jason Dagit wrote:
In other words, don't be shy!
Ok, thanks for the reply! :) However, a question about haddock:
evalMState :: Forkable m
= MState t m a -- ^ Action to evaluate
- t -- ^ Initial state value
On Friday 02 July 2010 22:32:37, Nils Schweinsberg wrote:
On 02.07.2010 20:05, Jason Dagit wrote:
In other words, don't be shy!
Ok, thanks for the reply! :) However, a question about haddock:
evalMState :: Forkable m
= MState t m a -- ^ Action to evaluate
And here wo go. MState on hackage:
http://hackage.haskell.org/package/mstate
My first hackage library. :)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 02/07/10 14:43, Edward Kmett wrote:
Knowledge of Haskell means very different things to different
people. I'd be somewhat leery of blindly hiring someone based on their
ability to answer a couple of pop Haskell quiz questions.
Fair enough, and I should probably have put a smiley in
Hi all,
I'd be interested in studying GUI (wxhaskell) code. Does anyone have
links to good gui code?
Best regards
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Andrew Coppin wrote:
Hmm, interesting. Applicative and Traversable are two classes I've never
used and don't really understand the purpose of.
Their main purpose is to avoid the list bias so prevalent from the
Lispish side of FP. Namely, there are many different kinds of
collections which
My work environment is what I'd call typical US corporate - IRC nodes are
blocked, but I can use a web-based client to access it.
A couple of days ago, someone had the poor taste to throw a pack of rabid
spam bots into the #haskell channel, forcing the short-term solution of
shutting down all
On 7/2/10 11:01 AM, Brandon S Allbery KF8NH wrote:
Although now that I think about it, if we're just appending to the state,
this should possibly be a Writer instead of a State; the interface is simpler.
The problem with this approach is that the hash context isn't a monoid;
you can
On 02.07.2010 23:02, Günther Schmidt wrote:
Hi all,
I'd be interested in studying GUI (wxhaskell) code. Does anyone have
links to good gui code?
Not wxHaskell, but I just wrote a very small gtk2hs application.[1]
Should give you a quick overview of how things work with gtk. :)
[1]
On 7/2/10 5:16 AM, Vincent Hanquez wrote:
It's necessary in my case since i receive chunks of data to be hashed from the
network, and I don't want to carry a buffer of data (with potential security
issues), until i can hash everything.
As an aside, this kind of pattern where you are
f :: forall a b. C a b = T a - Bool
f T1 = True
f T2 = (op :: a - b) 3
as that results in the counter-intuitive
Couldn't match expected type `Bool' against inferred type `b'
`b' is a rigid type variable bound by
the type signature for `f'
at
OK, here's the cleaned up repo. ready for action:
http://github.com/chrisdone/gd
Uploaded to Hackage with me as maintainer: http://hackage.haskell.org/package/gd
On 2 July 2010 21:34, Christopher Done chrisd...@googlemail.com wrote:
On 2 July 2010 20:29, Matthew Gruen wikigraceno...@gmail.com
On Friday 02 July 2010 6:23:53 pm Claus Reinke wrote:
-- second, while trying the piece with classic, non-equality constraints
Prelude (id :: (forall b. Eq b=b-b) - (forall b. Eq b=b-b))
interactive:1:0:
No instance for (Show ((forall b1. (Eq b1) = b1 - b1) - b - b))
arising from
Deniz Dogan deniz.a.m.do...@gmail.com writes:
Why should it not become part of Emacs?
I would like it if this Haskell indenter was external to haskell-mode
itself instead of making haskell-mode external to Emacs.
Why should it?
Look at all the effort that the Haskell community went through
Walt Rorie-Baety black.m...@gmail.com writes:
My work environment is what I'd call typical US corporate - IRC nodes are
blocked, but I can use a web-based client to access it.
A couple of days ago, someone had the poor taste to throw a pack of rabid
spam bots into the #haskell channel,
aditya siram aditya.si...@gmail.com writes:
Maybe the codebase he's hiring for makes heavy use of Applicative,
Traversable, unboxing etc.
Nah, I talked to him about it last night (because like Andrew I've never
really used either of those classes, though I do know what hsc2hs is,
just never
Daniel Fischer daniel.is.fisc...@web.de writes:
On Friday 02 July 2010 22:32:37, Nils Schweinsberg wrote:
On 02.07.2010 20:05, Jason Dagit wrote:
In other words, don't be shy!
Ok, thanks for the reply! :) However, a question about haddock:
evalMState :: Forkable m
=
Including the café.
On Jul 2, 2010 8:49 AM, Mark Wright markwri...@internode.on.net wrote:
Hi,
I'm trying to upgrade Hackage show to QuickCheck 2, after
applying the diffs below (which may not be correct, since I am
a beginner), I am left which this error message:
runghc ./Setup.hs build
On Saturday 03 July 2010 00:52:00, Ivan Lazar Miljenovic wrote:
It's been fixed in the 2.7 release apparently (I haven't upgraded, so
I haven't checked that myself).
Speaking of which, haddock-2.7.* came with 6.12.1, I believe, but from
6.12.2 on, haddock's version number was back down to
On Sat, Jul 3, 2010 at 1:07 AM, Deniz Dogan deniz.a.m.do...@gmail.com wrote:
Since there is no reason what so ever to integrate this external
Haskell indenter tightly into haskell-mode, I don't see any reason to
do so. Doing so would only mean that haskell-mode will most likely
never be a
Deniz Dogan deniz.a.m.do...@gmail.com writes:
Doing so would only mean that haskell-mode will most likely never be a
part of Emacs, meaning that anyone looking for programming Haskell in
Emacs would have to download an external library, be it through
package.el or not.
And what's so bad
Daniel Fischer daniel.is.fisc...@web.de writes:
On Saturday 03 July 2010 00:52:00, Ivan Lazar Miljenovic wrote:
It's been fixed in the 2.7 release apparently (I haven't upgraded, so
I haven't checked that myself).
Speaking of which, haddock-2.7.* came with 6.12.1, I believe, but from
On Saturday 03 July 2010 01:36:11, Ivan Lazar Miljenovic wrote:
No, 2.7 came out after 6.12.1 was released.
Yes, right. I had installed 2.7 on its own (to see whether a bug displaying
infix data constructors was fixed there) and misremembered. Still odd that
GHC ships with 2.6 long after 2.7
Daniel Fischer daniel.is.fisc...@web.de writes:
On Saturday 03 July 2010 01:36:11, Ivan Lazar Miljenovic wrote:
No, 2.7 came out after 6.12.1 was released.
Yes, right. I had installed 2.7 on its own (to see whether a bug displaying
infix data constructors was fixed there) and
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 7/2/10 17:24 , Gregory Crosswhite wrote:
The problem with this approach is that the hash context isn't a monoid; you
can absorb data into the context, but you can't combine two hash contexts to
form a new one. Thus, the Writer monad won't work
On Fri, Jul 02, 2010 at 08:48:07PM -0400, Brandon S Allbery KF8NH wrote:
On 7/2/10 17:24 , Gregory Crosswhite wrote:
The problem with this approach is that the hash context isn't a monoid; you
can absorb data into the context, but you can't combine two hash contexts to
form a new one.
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 7/2/10 20:51 , John Meacham wrote:
On Fri, Jul 02, 2010 at 08:48:07PM -0400, Brandon S Allbery KF8NH wrote:
On 7/2/10 17:24 , Gregory Crosswhite wrote:
The problem with this approach is that the hash context isn't a monoid; you
can absorb data
On Fri, Jul 2, 2010 at 4:59 PM, Nils Schweinsberg m...@n-sch.de wrote:
And here wo go. MState on hackage:
http://hackage.haskell.org/package/mstate
My first hackage library. :)
Awesome. I needed something like that once, too, down to the same type
signature for the fork function. Here's an
On 7/2/10 9:13 PM, Brandon S Allbery KF8NH wrote:
If you read the example code I posted, the point was how to turn the current
monolithic hash function into a cumulative one by using Writer. As such,
there's no opaque hash state inside the Writer. (see `hash . runWriter').
You can do
andrewcoppin:
Edward Kmett wrote:
Knowledge of Haskell means very different things to different
people. I'd be somewhat leery of blindly hiring someone based on their
ability to answer a couple of pop Haskell quiz questions.
A better test might be if they really understood Applicative
Don Stewart d...@galois.com writes:
andrewcoppin:
Edward Kmett wrote:
Knowledge of Haskell means very different things to different
people. I'd be somewhat leery of blindly hiring someone based on their
ability to answer a couple of pop Haskell quiz questions.
A better test might be if
On 03.07.2010 03:27, Matthew Gruen wrote:
Awesome. I needed something like that once, too, down to the same type
signature for the fork function. Here's an instance from my code:
instance MonadFork (ReaderT s IO) where
fork newT = ask= liftIO . forkIO . runReaderT newT
I've added this
ivan.miljenovic:
Hmm, interesting. Applicative and Traversable are two classes I've never
used and don't really understand the purpose of. I have no idea what
hsc2hs is. I keep hearing finger trees mentioned, but only in connection
to papers that I can't access. So I guess that means
On Jul 2, 2010, at 7:08 PM, Ivan Lazar Miljenovic wrote:
Knowing about something /= knowing how to use it. I own and have read
RWH, but I've never had to use hsc2hs, or Applicative, etc.
Applicative is nice. I had to Google for hsc2hs. This is what I get
for learning Haskell from the
Hello,
Suppose I have the following fragment of a posting:
Message: 3
Date: Fri, 2 Jul 2010 12:32:43 -0500
From: aditya siram aditya.si...@gmail.com
Subject: Re: [Haskell-cafe] How easy is it to hire Haskell programmers
To: Andrew Coppin andrewcop...@btinternet.com
Cc:
70 matches
Mail list logo
