Le Sun, 25 Nov 2012 21:41:47 +,
Gytis Žilinskas gytis.zilins...@gmail.com a écrit :
Greetings,
I'm only taking my very first steps learning Haskell, but I believe
that this mailing list might be appropriate for my question.
How difficult would it be to study category theory and
Andreas Abel andreas.a...@ifi.lmu.de writes:
I had been missing a pattern matching lambda in Haskell for
a long time (SML had fn since ages) and my typical use
will be
monadic_expr = \case
branches
We’ve been through that. I want something similar, but would
have preferred something
Hi,
I just released the first version of a package that provide new
additions to base for older versions of base [2]. So far the following
is covered:
readMaybe
readEither
lookupEnv
getExecutablePath
Source is on GitHub [2]; patches welcome ;)
Cheers,
Simon
[1]
Jon Fairbairn jon.fairba...@cl.cam.ac.uk writes:
[...]
“\case” complicates lambda, using “of” simply breaks “case … of …”
into two easily understood parts.
Just some observation (I'm rather late to the lambda-case discussion, so
this might have been already pointed out previously):
if the
Adding could be useful.
On Fri, Nov 30, 2012 at 12:23 PM, Simon Hengel s...@typeful.net wrote:
Hi,
I just released the first version of a package that provide new
additions to base for older versions of base [2]. So far the following
is covered:
readMaybe
readEither
On Fri, Nov 30, 2012 at 02:32:12PM +0100, dag.odenh...@gmail.com wrote:
Adding could be useful.
Yes, patch is welcome ;)
Cheers,
Simon
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, Nov 30, 2012 at 02:33:54AM +0100, Ben Franksen wrote:
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
Oh, PLEASE people. Let's not have another round of bikeshedding about
this AFTER the feature is already implemented!
-Brent
On Fri, Nov 30, 2012 at 01:25:27PM +0100, Herbert Valerio Riedel wrote:
Jon Fairbairn jon.fairba...@cl.cam.ac.uk writes:
[...]
“\case” complicates lambda, using
Right, case..of is superfluous,
case e of
branches
can now be written as
e | \case
branches
with backwards application | (or some prefer --- sadly, the proposal
to add backwards appliation to base did not make it to a consensus).
This is in accordance to the monadic
me =
Lists! The finite kind.
This could mean Seq for instance.
On Nov 30, 2012 9:53 AM, Brent Yorgey byor...@seas.upenn.edu wrote:
On Fri, Nov 30, 2012 at 02:33:54AM +0100, Ben Franksen wrote:
Brent Yorgey wrote:
On Thu, Nov 29, 2012 at 03:52:58AM +0100, Ben Franksen wrote:
Tony Morris
On 11/30/12 10:44 AM, Dan Doel wrote:
Lists! The finite kind.
This could mean Seq for instance.
On Nov 30, 2012 9:53 AM, Brent Yorgey byor...@seas.upenn.edu
mailto:byor...@seas.upenn.edu wrote:
Any data type which admits structures of arbitrary but *only finite*
size has a natural
Hi Mark,
For my bachelor thesis I am doing something somewhat in that direction. I
am developing a Echo State Neural Networks (ESNs) (
http://minds.jacobs-university.de/esn_research) library in Haskell. I
haven't worked on it for a while, since I was reading related literature in
the last months.
Haskell's laziness is tricky to understand coming from imperative
languages, but once you figure out its evaluation rules, you'll begin to
see the elegance.
Is there a paper or other single resource that will help me thoroughly
understand non-strictness in Haskell? Once my programs hit a
On Tue, Nov 27, 2012 at 11:02 AM, Jeff Shaw shawj...@gmail.com wrote:
Once each minute, a thread of my program updates a global state, stored in
an IORef, and updated with atomicModifyIORef', based on query results via
HDBC-obdc.
Incidentally, what kind of database are you talking to? Issues
For the record, it turned out that the key difference between the linux
machines was the fonts packages installed via RPM. The strace utility told me
that the crash happened shortly after cairo/pango attempted (and failed) to
open some font configuration files. After installing some of the
Hi,
Wow, that's weird. I wonder what kinds of fonts were missing? I was just
using the default cairo font everywhere.
On Fri, Nov 30, 2012 at 11:27 PM, Malcolm Wallace malcolm.wall...@me.comwrote:
For the record, it turned out that the key difference between the linux
machines was the fonts
Hi Mark
I can work on couple of algorithms if you have anything specific in mind.
May be first start with how to represent the matrix and then continue with
algorithms.
Mukesh Tiwari
On Fri, Nov 30, 2012 at 3:33 AM, Mark Flamer m...@flamerassoc.com wrote:
I am looking to continue to learn
On Sat, Dec 1, 2012 at 1:16 AM, Mark Thom markjordant...@gmail.com wrote:
Is there a paper or other single resource that will help me thoroughly
understand non-strictness in Haskell?
If performance is utterly vital the best resource is Core, as in, the
ability to read it. The order of
Of course. There is no reason to think that FRP is limited to real-time
applications with complicated interactions.
(...)
there is a somewhat comprehensive tutorial [1] as well
as lots of examples [2] linked from the wiki.
Thank you for the links. I read it and looked at the examples.
It
I know it's not wx, but if you were willing to use GTK, you could simply
install:
http://hackage.haskell.org/package/gtk-jsinput
and generate the form automatically as described in:
https://github.com/timthelion/gtk-jsinput/blob/master/Graphics/UI/Gtk/Custom/JSInput.hs
Cool!
Would rather
Why do you want to incrementally update this list a lot of times?
The question would affect the answer you get; i.e. some context
(non-monadically speaking). :D
On Wed, Nov 28, 2012 at 3:43 AM, Branimir Maksimovic bm...@hotmail.com wrote:
Problem is following short program:
list = [1,2,3,4,5]
Hi,
I published zeromq3-conduit, a small library which facilitates using
zeromq3-haskell, a binding for ZeroMQ 3.x, in a Conduit-based
application.
The 'examples' folder in the source repository contains ports of the
zeromq3-haskell examples.
The library also contains a module which might ease
Thanks for all the replies,
It sounds like there is enough interest and even some potential
collaborators out there. I have created a few data structures to represent
sparse vectors and matrices. The vector was a simple binary tree and the
matrix a quad tree. As I suspected a standard IntMap was
Gershom Bazerman wrote:
On 11/30/12 10:44 AM, Dan Doel wrote:
Lists! The finite kind.
This could mean Seq for instance.
On Nov 30, 2012 9:53 AM, Brent Yorgey byor...@seas.upenn.edu
mailto:byor...@seas.upenn.edu wrote:
Any data type which admits structures of arbitrary but *only
I look forward to see what comes of this!
On Fri, Nov 30, 2012 at 4:58 PM, Mark Flamer m...@flamerassoc.com wrote:
Thanks for all the replies,
It sounds like there is enough interest and even some potential
collaborators out there. I have created a few data structures to represent
sparse
Dear everyone,
After a number of attempts [1] I'm starting to think that my initial
approach was ill-directed.
After all, Functor, Applicative, Zip are three different classes.
Functors are type constructors where you can map unary functions over them.
Applicatives are those with map-over of
You might find this paper an interesting read: http://www.brics.dk/RS/01/10/
On Fri, Nov 30, 2012 at 4:43 PM, Takayuki Muranushi muranu...@gmail.comwrote:
Dear everyone,
After a number of attempts [1] I'm starting to think that my initial
approach was ill-directed.
After all, Functor,
On 11/30/2012 1:29 PM, Bryan O'Sullivan wrote:
On Tue, Nov 27, 2012 at 11:02 AM, Jeff Shaw shawj...@gmail.com
mailto:shawj...@gmail.com wrote:
Once each minute, a thread of my program updates a global state,
stored in an IORef, and updated with atomicModifyIORef', based on
query
Ben,
Now, on to Bind: the standard finite structure example for Bind is
most probably the substitution thingy ...
Danger of conflating a bunch of things here:
(1) the substitution monadic effect is always also applicative and always
also unital/pointed because monads are always applicative and
29 matches
Mail list logo
