On 5 August 2010 16:48, Gregory Crosswhite wrote:
> On 8/4/10 11:40 PM, Andrew Coppin wrote:
>>
>> Ivan Lazar Miljenovic wrote:
>>>
>>> Don't forget, GHC is open source: if this lack really was "dumb" and
>>> annoying you, there was nothing stopping you from rectifying this
>>> situation up until
On 8/4/10 11:40 PM, Andrew Coppin wrote:
Ivan Lazar Miljenovic wrote:
Don't forget, GHC is open source: if this lack really was "dumb" and
annoying you, there was nothing stopping you from rectifying this
situation up until now.
Except that, in the real world, this is actually completely
inf
Victor Nazarov wrote:
I think it is more simple like:
class Bijection a b where
...
type LeftToRight a = (Bijection a b) => b
type RightToLeft b = (Bijection a b) => a
Hmm, yes... That looks like it could work.
___
Haskell-Cafe mailing list
Ha
Ivan Lazar Miljenovic wrote:
Don't forget, GHC is open source: if this lack really was "dumb" and
annoying you, there was nothing stopping you from rectifying this
situation up until now.
Except that, in the real world, this is actually completely infeasible.
Yes, I know it's the basic tena
Hi All:
I have been trying to use System.timeout in windows, but for some
reason it doesn't work, a concrete example is:
import Network.HTTP
import System.Timeout
main = do
rsp <- timeout 1000 $ simpleHTTP $ getRequest "http://10.1.2.3";
case rsp of
Just rsp -> print $ show rsp
On 4 August 2010 03:45, Ryan Ingram wrote:
> So I believe the "final" way to do this, which is not yet implemented,
> works something like this:
>
> type family LeftToRight a
> type family RightToLeft b
>
> class (LeftToRight a ~ b, RightToLeft b ~ a) => Bijection a b where
> ...
>
> I agree, th
On Tue, Aug 3, 2010 at 9:45 PM, Ryan Ingram wrote:
> So I believe the "final" way to do this, which is not yet implemented,
> works something like this:
>
> type family LeftToRight a
> type family RightToLeft b
>
> class (LeftToRight a ~ b, RightToLeft b ~ a) => Bijection a b where
> ...
>
> I a
The documentation is a little confusing on this issue. It sounded to
me when I read the documentation that all of the *OS* threads were
blocked by the FFI, when what was meant was that all of the *IO* threads
assigned to the calling OS thread are what is blocked, because the docs
just say tha
Ivan Lazar Miljenovic wrote:
> On 5 August 2010 13:32, Mark Wotton wrote:
> > On Thu, Aug 5, 2010 at 1:29 PM, Ivan Lazar Miljenovic
> > wrote:
> >> On 5 August 2010 13:23, Mark Wotton wrote:
> >>> Might it be possible to enable multiple maintainers on packages, each
> >>> of whom can upload new
On 5 August 2010 13:32, Mark Wotton wrote:
> On Thu, Aug 5, 2010 at 1:29 PM, Ivan Lazar Miljenovic
> wrote:
>> On 5 August 2010 13:23, Mark Wotton wrote:
>>> Might it be possible to enable multiple maintainers on packages, each
>>> of whom can upload new versions? As far as I can tell, that's no
On Thu, Aug 5, 2010 at 1:29 PM, Ivan Lazar Miljenovic
wrote:
> On 5 August 2010 13:23, Mark Wotton wrote:
>> Might it be possible to enable multiple maintainers on packages, each
>> of whom can upload new versions? As far as I can tell, that's not
>> currently possible with Cabal.
>
> Huh? Cabal
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 8/4/10 17:16 , Andrew Coppin wrote:
> I have a vague recollection of there being a situation to do with calling
> foreign code that makes all Haskell threads block in the non-threaded RTS,
> but not in the threaded one. Depending on how big your sen
On 5 August 2010 13:23, Mark Wotton wrote:
> Might it be possible to enable multiple maintainers on packages, each
> of whom can upload new versions? As far as I can tell, that's not
> currently possible with Cabal.
Huh? Cabal doesn't care who the maintainers are: it just has a text
field where
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 8/4/10 08:04 , Frank Kupke wrote:
> After chatting with Chris privately it turned out that the confusion within
> the Chat example is partly because I did not find a good and simple solution
> for mixing user input and chat output asynchronously i
On Wed, Aug 4, 2010 at 1:36 AM, Ben Millwood wrote:
> On Sun, Jul 18, 2010 at 3:02 AM, Mark Wotton wrote:
>>
>> I've uploaded haskell-src-meta-mwotton, using the development version.
>> It seems to work fine for my applications. It's a bit of a hack, but I
>> can't think of a better way to do it
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 8/4/10 05:11 , Magnus Therning wrote:
> Also very good looking. Does the current stable version of Haddock really
> create a frame version?
> I've never seen one before...
http://www.haskell.org/ghc/docs/current/html/libraries/frames.html
- --
b
On 5 August 2010 10:15, Lennart Augustsson wrote:
> You're right. It's bad to have toRational in Real. It's also bad to
> have Show and Eq as superclasses to Num.
I understand why it's bad to have Show as a superclass, but why Eq?
Because it stops you from using functions as numbers, etc. ?
-
> Why is toRational a method of Real? I thought that real numbers need not
> be rational, such as the square root of two. Wouldn't it make more sense
> to have some sort of Rational typeclass with this method?
I think everyone has problems with the Haskell numeric typeclasses.
The answer in this c
On Wed, Aug 04, 2010 at 02:30:10PM -0400, Omari Norman wrote:
> Why is toRational a method of Real? I thought that real numbers need not
> be rational, such as the square root of two. Wouldn't it make more sense
> to have some sort of Rational typeclass with this method? Thanks.
The numeric classe
You're right. It's bad to have toRational in Real. It's also bad to
have Show and Eq as superclasses to Num.
On Wed, Aug 4, 2010 at 8:30 PM, Omari Norman wrote:
> Why is toRational a method of Real? I thought that real numbers need not
> be rational, such as the square root of two. Wouldn't it
For me, the following two things did the magic, so I'll suggest them:
1.
Writing a recursive function that takes a binary tree and returns the
same tree, but with its leaves enumerated. Each function call takes the
tree and the counter and returns the resulting tree and the new counter
value.
On 3 Aug 2010, at 23:51, aditya siram wrote:
I am doing an "Intro To Monads" talk in September [1]. The audience
consists of experienced non-Haskell developers but they will be
familiar with basic functional concepts (closures, first-class
functions etc.).
I am looking for suggestions on
On Wed, 4 Aug 2010, Don Stewart wrote:
job.vranish:
Hmm, it looks like the HASP project is working on some of this, though I'm not
sure how portable their work is back to GHC: http://hasp.cs.pdx.edu/
Or look at EDSLs, like Atom:
http://hackage.haskell.org/package/atom
Maybe Feldspar,
job.vranish:
> + 1
>
>
> This is probably the biggest obstacle to using Haskell where I work. (Aviation
> industry, software for flight management systems for airplanes)
>
> We often need to perform some computations with hard deadlines, say every
> 20ms,
> with very little jitter.
> Major GC's
Christopher Done writes:
> On 4 August 2010 10:43, Chris Eidhof wrote:
>> This looks very cool! It would be nice to put the pdf online somewhere, and
>> add a link from the package documentation
>
> Regarding that, it would be nice if Hackage let you access the files
> in the package instead of
Frank Kupke wrote:
Andrew,
Thanks for pointing your finger at it
Am 04.08.2010 um 17:48 schrieb Andrew Coppin:
In that case, is there a way to determine whether or not the rest of the
transaction completed? Because it looks like you can the same exception either
way, regardless of whether
+ 1
This is probably the biggest obstacle to using Haskell where I work.
(Aviation industry, software for flight management systems for airplanes)
We often need to perform some computations with hard deadlines, say every
20ms, with very little jitter.
Major GC's spoil the fun; It's quite easy to
On Wed, Aug 4, 2010 at 2:11 AM, Magnus Therning wrote:
> On Wed, Aug 4, 2010 at 06:00, Mark Lentczner wrote:
> > The Haddock team has spent the last few months revamping the look of the
> generated output. We're pretty close to done, but we'd like to get the
> community's input before we put it
On Wed, 4 Aug 2010, Stephen Sinclair wrote:
On Aug 3, 8:31 pm, Jeremy Shaw wrote:
The only area I have had any trouble with Haskell is doing realtime
music synthesis. And only because the garbage collector is not
realtime friendly. That is not unfixable though. However, I am
thinking that th
Andrew,
Thanks for pointing your finger at it
Am 04.08.2010 um 17:48 schrieb Andrew Coppin:
> Frank Kupke wrote:
>> Good questions. I am about to write a paper explaining the design of the
>> DSTM library in more detail which I will link when available. Please bear
>> with me, here. In the mean
On Aug 3, 8:31 pm, Jeremy Shaw wrote:
> The only area I have had any trouble with Haskell is doing realtime
> music synthesis. And only because the garbage collector is not
> realtime friendly. That is not unfixable though. However, I am
> thinking that the best way to do realtime synthesis with
On Wed, Aug 4, 2010 at 3:37 AM, Ivan Lazar Miljenovic <
ivan.miljeno...@gmail.com> wrote:
> Marc Weber writes:
>
> > Hi Qi,
> >
> > have a look at brainfuck language. Its turing complete as Python,
> Haskell, etc
> > are. Then you'll learn that the quesntion "Can I do everything possible"
> > is
Both Git and GitHub are fantastic. (and very convenient for contributors)
Also if you're the kind of person who's into GUI's, SmartGit is quite good
as well.
- Job
On Wed, Aug 4, 2010 at 3:28 PM, Frank Kupke wrote:
> John,
>
> a very nice idea. I have not worked with git yet but used an svn rep
John,
a very nice idea. I have not worked with git yet but used an svn repository on
our institute server. I will look into it though and eventually set something
up. In the meantime you are welcome to send patches to me for merging them into
the project.
Frank
Am 04.08.2010 um 18:54 schrieb
On 10-08-04 01:00 AM, Mark Lentczner wrote:
Sample pages: http://www.ozonehouse.com/mark/snap-xhtml/index.html
On the Contents page, among the collapsable trees: when I click on a
link that is also a parent, such as Snap.Http.Server and
Text.Templating.Heist, it has the undesirable side effe
On Aug 4, 2010, at 11:30 AM, Omari Norman wrote:
Why is toRational a method of Real? I thought that real numbers need
not
be rational, such as the square root of two. Wouldn't it make more
sense
to have some sort of Rational typeclass with this method? Thanks.
You can't build the real num
Why is toRational a method of Real? I thought that real numbers need not
be rational, such as the square root of two. Wouldn't it make more sense
to have some sort of Rational typeclass with this method? Thanks.
--Omari
___
Haskell-Cafe mailing list
Hask
On Tue, Aug 3, 2010 at 8:23 AM, Felipe Lessa wrote:
> On Tue, Aug 3, 2010 at 8:01 AM, Ivan Lazar Miljenovic
> wrote:
>> Felipe Lessa writes:
>>> 'hierarchical-clustering' provides a function to create a dendrogram
>>> from a list of items and a distance function between them. The most
>>> commo
On 5 Aug 2010, at 06:10, aditya siram wrote:
> This is slightly OT, but is there a way of getting some Emacs keybindings in
> Leksah?
You can add them to the keymap.lkshk, but you will be limited to adding things
leksah has commands for. If you do make some bindings please share them.
We are
This is slightly OT, but is there a way of getting some Emacs keybindings in
Leksah?
-deech
On Wed, Aug 4, 2010 at 1:01 PM, Hamish Mackenzie <
hamish.k.macken...@googlemail.com> wrote:
> I use Leksah and have done since I started contributing to it. The best
> way to make it work for you is to
I use Leksah and have done since I started contributing to it. The best way to
make it work for you is to use Leksah to fix what you don't like about Leksah
;-) Failing that giving good feedback about bugs and missing features is the
next best thing.
On 3 Aug 2010, at 18:48, David Virebayre
On 4 August 2010 18:40, Alexander Dunlap wrote:
> It's also nice for people reading code if common functions are
> functions from common libraries. This allows readers' "vocabulary" of
> common functions to increase, so they don't have to trawl through
> someone's personal "utility" library to fig
Nicolas Pouillard schrieb:
Right let's make it more explicit, I actually just wrote a Control.Seq
module and a test file:
module Control.Seq where
genericSeq :: Typeable a => a -> b -> b
genericSeq = Prelude.seq
class Seq a where
seq :: a -> b -> b
instance (Typeable a
On 4 August 2010 10:43, Chris Eidhof wrote:
> This looks very cool! It would be nice to put the pdf online somewhere, and
> add a link from the package documentation
Regarding that, it would be nice if Hackage let you access the files
in the package instead of having to extract the .tar.gz, as i
This came up a month or so ago, Don Stewart and others overviewed this
topic in detail:
http://www.haskell.org/pipermail/haskell-cafe/2010-May/077154.html
On 4 August 2010 13:07, Charles-Pierre Astolfi wrote:
> Hey there,
>
> I'm searching for software designs in Haskell ; for example, I have a
On Wed, 04 Aug 2010 18:04:13 +0200, Janis Voigtländer
wrote:
> Nicolas Pouillard schrieb:
> > On Wed, 04 Aug 2010 17:47:12 +0200, Janis Voigtländer
> > wrote:
> >> Nicolas Pouillard schrieb:
> >>> On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
> >>> wrote:
> Nicolas Pouillard schr
Ertugrul Soeylemez wrote:
> forkIO . forever $ takeMVar logVar >>= hPutStrLn stderr
hPutStrLn should become hPutStr, otherwise the output may look
strange. =)
Greets,
Ertugrul
--
nightmare = unsafePerformIO (getWrongWife >>= sex)
http://ertes.de/
Charles-Pierre Astolfi wrote:
> I'm searching for software designs in Haskell ; for example, I have a
> pretty good ideo of how I would arrange my modules/classes (in
> ocaml/(java/c++)) and how they would all fit together to create, say,
> a website aspirator. But I don't have any clue of the ri
On Wed, Aug 4, 2010 at 1:00 AM, Mark Lentczner wrote:
> The Haddock team has spent the last few months revamping the look of the
> generated output. We're pretty close to done, but we'd like to get the
> community's input before we put it in the main release.
>
> Please take a look, and then giv
Great work!
I'm sure you're already aware of
http://sphinx.pocoo.org/
which is used to generate the Python docs. A lot of good ideas there.
One thing which would be great would be to integrate their javascript
in-browser text search engine. Obviously not a priority but it might
be nice.
Best
On Tue, Aug 3, 2010 at 8:33 PM, Claude Heiland-Allen
wrote:
> {-# LANGUAGE TemplateHaskell, ScopedTypeVariables #-}
> import Language.Haskell.Djinn (djinnD)
> $(djinnD "maybeToEither" [t|forall a b . a -> Maybe b -> Either a b|])
> main = print . map (maybeToEither "foo") $ [Nothing, Just "bar"]
Is there a Git/Darcs dev repo hiding anywhere we could submit patches to?
On Tue, Aug 3, 2010 at 4:35 AM, Frank Kupke wrote:
> Hi,
>
> DSTM is an implementation of a robust distributed Software Transactional
> Memory (STM) library for Haskell. Many real-life applications are distributed
> by na
On Wed, Aug 4, 2010 at 9:21 AM, Henning Thielemann
wrote:
> Ivan Lazar Miljenovic schrieb:
>> Yitzchak Gale writes:
>
>>> While useful, I think its ubiquity to simplicity ratio is not
>>> high enough to justify either depending on MissingH
>>> just for that, or adding it to a base library.
>>
>>
Ivan Lazar Miljenovic schrieb:
> Yitzchak Gale writes:
>> While useful, I think its ubiquity to simplicity ratio is not
>> high enough to justify either depending on MissingH
>> just for that, or adding it to a base library.
>
> Just like the swap :: (a,b) -> (b,a) function a lot of people were
Hi folks,
I just installed the latest Haskell Platform on a fresh Ubuntu Lucid machine
and I had to install the following packages to satisfy Open GL:
libgmp3-dev,libgl1-mesa-dev, libglu1-mesa-dev, freeglut3-dev
Just thought you might want to document that on the Haskell Platform page.
-deech
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:47:12 +0200, Janis Voigtländer
wrote:
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
wrote:
Nicolas Pouillard schrieb:
However the rule is still the same when using an unsafe function you are on
your own.
On Wed, 04 Aug 2010 17:47:12 +0200, Janis Voigtländer
wrote:
> Nicolas Pouillard schrieb:
> > On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
> > wrote:
> >> Nicolas Pouillard schrieb:
> >>> However the rule is still the same when using an unsafe function you are
> >>> on
> >>> your own.
Frank Kupke wrote:
Good questions. I am about to write a paper explaining the design of the DSTM
library in more detail which I will link when available. Please bear with me,
here. In the meantime please find some shorter answers below.
Well, that was pretty comprehensive. A few questions
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
wrote:
Nicolas Pouillard schrieb:
However the rule is still the same when using an unsafe function you are on
your own.
Clearer?
Almost. What I am missing is whether or not you would then consider your
genericS
This is something I've wanted for a long time, but I always intended
to just submit a patch since it would be trivial, but maybe other
people have an opinion about it too:
I've always wanted a button to collapse or maybe toggle all expanded
branches. Once a library gets large, it's easier to navi
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
wrote:
> Nicolas Pouillard schrieb:
> > However the rule is still the same when using an unsafe function you are on
> > your own.
> >
> > Clearer?
>
> Almost. What I am missing is whether or not you would then consider your
> genericSeq (whi
I think what the OP is asking for is a killer application of Haskell - Ruby,
for example, is great for web programming because of Rails.
The Haskell community is somewhat unique in that it has many killer apps and
that confuses people. It's great for version control (Darcs), window
managers (XMon
Nicolas Pouillard schrieb:
However the rule is still the same when using an unsafe function you are on
your own.
Clearer?
Almost. What I am missing is whether or not you would then consider your
genericSeq (which is applicable to functions) one of those "unsafe
functions" or not.
Ciao,
Janis.
On Wed, Aug 4, 2010 at 12:49 AM, kirstin penelope rhys
wrote:
> But now I need a fast multidimensional array which can handle a tuple of
> primitive types.
>
> My options, as far an I can see, are:
>
> 1) Add an instance for UArray (Int,Int) (Word16, Word16, Word16)
> and/or UArray (Int,Int) (Word
In my experience two of the biggest issues in selecting any language
are the pool of potential programmers and the learning curve for the
programmers you already have.
If you only need two programmers to do a project and they both know
Haskell well, then I think Haskell would do almost any job ver
On Wed, 04 Aug 2010 15:41:54 +0200, Janis Voigtländer
wrote:
> Nicolas Pouillard schrieb:
> >>> Actually I think we can keep the old generic seq, but cutting its full
> >>> polymorphism:
> >>>
> >>> seq :: Typeable a => a -> b -> b
> >> I guess I don't know enough about Typeable to appreciate tha
On 4 August 2010 15:44, aditya siram wrote:
> I really like the color scheme and the Javadoc looking frames.
>
> One suggestion I can make is to have the index show all the functions with
> type signatures without having to pick a letter. A lot of times I'll be
> looking for a function of a certai
I really like the color scheme and the Javadoc looking frames.
One suggestion I can make is to have the index show all the functions with
type signatures without having to pick a letter. A lot of times I'll be
looking for a function of a certain signature as opposed to a name. Indeed
an index of t
A few points,
* The text in Synopsis part is typically wide. (See
http://www.ozonehouse.com/mark/snap-xhtml/heist/Text-Templating-Heist.htmlwith
Ocean style)
I think it would be more *usable *if it was at the bottom of the page (again
with a similar button and open/close toggling effect)
* On my
On Wed, Aug 4, 2010 at 3:16 AM, Alberto G. Corona wrote:
> Just to clarify, I mean: Haskell may be seriously addictive. Sounds like
> a joke, but it is not. I do not recommend it for coding something quick and
> dirty.
>
I use it for quick and dirty stuff all the time, mainly because what I wa
Mark Lentczner wrote:
> The Haddock team...
> Please take a look, and then give us your feedback
Very very nice. I took the survey, but here are some comments
I left out.
I like the idea of the Snappy style the best, but there are two
serious problems with it, at least in my browser (Safari):
1.
Good questions. I am about to write a paper explaining the design of the DSTM
library in more detail which I will link when available. Please bear with me,
here. In the meantime please find some shorter answers below.
Regards,
Frank
Am 04.08.2010 um 10:53 schrieb Andrew Coppin:
> Frank Kupke w
Nicolas Pouillard schrieb:
Actually I think we can keep the old generic seq, but cutting its full
polymorphism:
seq :: Typeable a => a -> b -> b
I guess I don't know enough about Typeable to appreciate that.
Basically the Typeable constraints tells that we dynamically know the identity
of the
On Tue, 03 Aug 2010 16:36:33 +0200, Janis Voigtländer
wrote:
> Nicolas Pouillard schrieb:
> >> - If there is no class instance for function types, then those problems
> >> go away, of course. But it is doubtful whether that would be a viable
> >> solution. Quite a few programs would be rejected a
On 4 August 2010 10:11, Magnus Therning wrote:
> On Wed, Aug 4, 2010 at 06:00, Mark Lentczner wrote:
>> The Haddock team has spent the last few months revamping the look of the
>> generated output. We're pretty close to done, but we'd like to get the
>> community's input before we put it in the
On 4 August 2010 23:13, Johannes Waldmann wrote:
>
>> However, if you tried to do "s.equalsIgnoreCase(", does it offer to
>> insert every single String available and every function that could
>> result in a String?
>
> well, try this:
>
> String s = "foo";
> String t
> However, if you tried to do "s.equalsIgnoreCase(", does it offer to
> insert every single String available and every function that could
> result in a String?
well, try this:
String s = "foo";
String t = "bar";
int u = 42;
s.equal
Tillmann Rendel writes:
> Ivan Lazar Miljenovic wrote::
>> My understanding of tab-completion in IDEs for Java, etc. is that it
>> just displayed every single possible class method for a particular
>> object value, and then did some kind of matching based upon what you
>> typed to narrow down the
Rogan Creswick wrote:
> Haskell has very limited support for high-level Natural Language
> Processing (tokenization, sentence splitting, Named-entity
> recognition, etc...).
Since the role of a general purpose language is relatively
new for Haskell, there are many areas where Haskell is still
an e
Ivan Lazar Miljenovic wrote::
My understanding of tab-completion in IDEs for Java, etc. is that it
just displayed every single possible class method for a particular
object value, and then did some kind of matching based upon what you
typed to narrow down the list, not that it was type-based.
G
On 4 August 2010 12:34, Thomas Schilling wrote:
> I believe the main reason why ghci isn't available on all platforms is
> the dynamic linker. I don't think it would be easy (or even feasible)
> to switch to something like 'ld', though.
AFAIK the current linker is meant to support Mach O, ELF an
Great! I like it a lot, but a couple of minor suggestions regarding the
"tree" view of modules. I think it would be more attractive (and
space-efficient) to have them indent a little less and to provide some sort
of visual link, in the form of even subtle branches, from parents to
children. A bit l
Johannes Waldmann writes:
>> My understanding of tab-completion in IDEs for Java, etc. is that it
>> just displayed every single possible class method for a particular
>> object value, and then did some kind of matching based upon what you
>> typed to narrow down the list, not that it was type-ba
> My understanding of tab-completion in IDEs for Java, etc. is that it
> just displayed every single possible class method for a particular
> object value, and then did some kind of matching based upon what you
> typed to narrow down the list, not that it was type-based.
With Eclipse, try somethi
I think the general process is the same. You define your components, try to
decouple them as much as possible and implement them. One thing that is
different from other languages: try to write as much pure code as possible.
This is great for creating composable components.
There are several dif
After chatting with Chris privately it turned out that the confusion within the
Chat example is partly because I did not find a good and simple solution for
mixing user input and chat output asynchronously in one terminal stream. One
can possibly do better, here.
Also, apparently I left some de
On Aug 4, 2010, at 5:11 AM, Magnus Therning wrote:
> Does the current stable version of Haddock really
> create a frame version?
> I've never seen one before...
Yes it does. For example, the standaed GHC book packages doc has the frames
version here:
http://www.haskell.org/ghc/docs/6.1
Hi,
aditya siram wrote:
For example in the beginning it was useful for me to think of monads
(and typeclasses really) as approximating Java interfaces.
Type classes are somewhat parallel to Java interfaces, but Monad is a
*specific* type class, so it should be somewhat parallel to a *specific
On 4 August 2010 12:05, Ivan Lazar Miljenovic wrote:
> Max Bolingbroke writes:
>
>> On 4 August 2010 11:39, Ivan Lazar Miljenovic
>> wrote:
>>> Joachim Breitner writes:
the problem is that Template Haskell does not work on all architectures,
so the Debian people prefer solutions that
Marc Weber writes:
> Excerpts from Ivan Lazar Miljenovic's message of Wed Aug 04 12:37:29 +0200
> 2010:
>> functionality in Emacs.
>
> I know - I patched the py backend for scion. I'm talking about:
>
> node.getParent().getParent().Attributes["value"]
>
> Or (let's talk about a haskell example
Hey there,
I'm searching for software designs in Haskell ; for example, I have a
pretty good ideo of how I would arrange my modules/classes (in
ocaml/(java/c++)) and how they would all fit together to create, say,
a website aspirator. But I don't have any clue of the right way to do
it with Haskel
Max Bolingbroke writes:
> On 4 August 2010 11:39, Ivan Lazar Miljenovic
> wrote:
>> Joachim Breitner writes:
>>> the problem is that Template Haskell does not work on all architectures,
>>> so the Debian people prefer solutions that avoid TH if it is not
>>> needed.
>>
>> Yeah, we've just come
On 4 August 2010 11:39, Ivan Lazar Miljenovic wrote:
> Joachim Breitner writes:
>> the problem is that Template Haskell does not work on all architectures,
>> so the Debian people prefer solutions that avoid TH if it is not
>> needed.
>
> Yeah, we've just come across this problem in Gentoo when d
Ivan Lazar Miljenovic writes:
>> On Wed, Aug 4, 2010 at 06:00, Mark Lentczner wrote:
>>> Frame version: http://www.ozonehouse.com/mark/snap-xhtml/frames.html
>>
> I quite like this new approach
Dammit, I just realised as I went to do the survey that the old framed
approach is almost identical t
Joachim Breitner writes:
> Hi,
>
> Am Mittwoch, den 04.08.2010, 08:05 +0100 schrieb Max Bolingbroke:
>> On 4 August 2010 07:42, Joachim Breitner wrote:
>> > out of a discussion in haskell-devscripts, John MacFarlane wrote a very
>> > nice tool, called hsb2hs, that allows you to include any binar
Marc Weber writes:
> Hi Qi,
>
> have a look at brainfuck language. Its turing complete as Python, Haskell, etc
> are. Then you'll learn that the quesntion "Can I do everything possible"
> is not at all important. You have to ask instead: Can I complete my
> task in reasonable time and with reaso
On Wed, Aug 4, 2010 at 1:50 AM, Donn Cave wrote:
> Quoth John Meacham ,
>
>> It is more an accident of ghc's design than anything, the same mechanism
>> that allowed threads to call back into the runtime also allowed them to
>> be non blocking so the previously used 'safe' and 'unsafe' terms got
>
Magnus Therning writes:
> On Wed, Aug 4, 2010 at 06:00, Mark Lentczner wrote:
>> The Haddock team has spent the last few months revamping the look of the
>> generated output. We're pretty close to done, but we'd like to get the
>> community's input before we put it in the main release.
>>
>> P
Just to clarify, I mean: Haskell may be seriously addictive. Sounds like a
joke, but it is not. I do not recommend it for coding something quick and
dirty.
2010/8/4 Alberto G. Corona
> Before entering haskell, please read our disclaimer:
>
> http://www.haskell.org/pipermail/haskell-cafe/2010-
I have added the permutation parsers from uulib to uu-parsinglib:
http://hackage.haskell.org/packages/archive/uu-parsinglib/2.5.1.1/doc/html/Text-ParserCombinators-UU-Perms.html,
where you find reference to the paper
Doaitse
On 22 jun 2010, at 09:24, Stephen Tetley wrote:
> Hello
>
> Maybe "
1 - 100 of 111 matches
Mail list logo
