Serguey Zefirov wrote:
Is it possible to delete an element from heterogenous list using type
families alone?
I can do it using multiparameter type classes:
class Del a list result
instance Del a (a,list) list
instance Del a list list' = Del a (a',list) list'
instance Del a () ()
I'm
Hi,
out of a discussion in haskell-devscripts, John MacFarlane wrote a very
nice tool, called hsb2hs, that allows you to include any binary (or
text) file as a constant in your program. This can be useful in various
instances, e.g. when creating programs that should not depend on data
files
On 4 August 2010 07:42, Joachim Breitner m...@joachim-breitner.de wrote:
out of a discussion in haskell-devscripts, John MacFarlane wrote a very
nice tool, called hsb2hs, that allows you to include any binary (or
text) file as a constant in your program.
When I've needed to do this in the
Hi,
Am Mittwoch, den 04.08.2010, 08:05 +0100 schrieb Max Bolingbroke:
On 4 August 2010 07:42, Joachim Breitner m...@joachim-breitner.de wrote:
out of a discussion in haskell-devscripts, John MacFarlane wrote a very
nice tool, called hsb2hs, that allows you to include any binary (or
text)
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 reasonable runtime performance etc.
Thanks. In fact, the server lookup is needed only to make initial contact to
another node, or better - as the distributed architecture is transparent to the
app programmer - to make initial contact to another TVar. This initial TVar
would then be able to distribute more TVars. It could be typed
data InitTVar a = TVar [TVar a]
sorry
Am 04.08.2010 um 10:04 schrieb Frank Kupke:
Thanks. In fact, the server lookup is needed only to make initial contact to
another node, or better - as the distributed architecture is transparent to
the app programmer - to make initial contact to another
Before entering haskell, please read our disclaimer:
http://www.haskell.org/pipermail/haskell-cafe/2010-June/079044.html
You've been warned
*
*
2010/8/4 Zura_ x...@gol.ge
As already noted here, Haskell is a general purpose language, but you
should
take it with a grain of salt.
For
This looks very cool! It would be nice to put the pdf online somewhere, and add
a link from the package documentation. Also, the chat client seems to have some
problems with output buffering on my system (OS X, GHC 6.12).
-chris
On 3 aug 2010, at 10:35, Frank Kupke wrote:
Hi,
DSTM is an
Frank Kupke wrote:
For usage please look into the documentation file: DSTMManual.pdf.
1. Any danger of puting this somewhere I can read it without having to
download and manually unpack the Hackage tarball?
2. Since DSTM depends on the Unix package, I presume this won't work on
Windows.
On Wed, Aug 4, 2010 at 06:00, Mark Lentczner ma...@glyphic.com 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,
2010/8/4 Mark Lentczner ma...@glyphic.com:
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 give us your
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
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 agocor...@gmail.com
Before entering haskell, please read our disclaimer:
Magnus Therning mag...@therning.org writes:
On Wed, Aug 4, 2010 at 06:00, Mark Lentczner ma...@glyphic.com 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
On Wed, Aug 4, 2010 at 1:50 AM, Donn Cave d...@avvanta.com wrote:
Quoth John Meacham j...@repetae.net,
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'
Marc Weber marco-owe...@gmx.de 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
Joachim Breitner m...@joachim-breitner.de writes:
Hi,
Am Mittwoch, den 04.08.2010, 08:05 +0100 schrieb Max Bolingbroke:
On 4 August 2010 07:42, Joachim Breitner m...@joachim-breitner.de wrote:
out of a discussion in haskell-devscripts, John MacFarlane wrote a very
nice tool, called
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com writes:
On Wed, Aug 4, 2010 at 06:00, Mark Lentczner ma...@glyphic.com 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
On 4 August 2010 11:39, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
Joachim Breitner m...@joachim-breitner.de 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
Max Bolingbroke batterseapo...@hotmail.com writes:
On 4 August 2010 11:39, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com
wrote:
Joachim Breitner m...@joachim-breitner.de writes:
the problem is that Template Haskell does not work on all architectures,
so the Debian people prefer solutions
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
Marc Weber marco-owe...@gmx.de 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().tabAttributes[value]
Or (let's talk about a
On 4 August 2010 12:05, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
Max Bolingbroke batterseapo...@hotmail.com writes:
On 4 August 2010 11:39, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com
wrote:
Joachim Breitner m...@joachim-breitner.de writes:
the problem is that Template
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
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:
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
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
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 something
Johannes Waldmann waldm...@imn.htwk-leipzig.de 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,
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
On 4 August 2010 12:34, Thomas Schilling nomin...@googlemail.com 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
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.
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
Tillmann Rendel ren...@informatik.uni-marburg.de 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
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;
On 4 August 2010 23:13, Johannes Waldmann waldm...@imn.htwk-leipzig.de 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;
On 4 August 2010 10:11, Magnus Therning mag...@therning.org wrote:
On Wed, Aug 4, 2010 at 06:00, Mark Lentczner ma...@glyphic.com 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
On Tue, 03 Aug 2010 16:36:33 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de 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
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
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
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.
On Wed, Aug 4, 2010 at 3:16 AM, Alberto G. Corona agocor...@gmail.comwrote:
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
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
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
On 4 August 2010 15:44, aditya siram aditya.si...@gmail.com 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
On Wed, 04 Aug 2010 15:41:54 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de 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
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
On Wed, Aug 4, 2010 at 12:49 AM, kirstin penelope rhys
kirs...@speakeasy.net 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
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.
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
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de 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
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
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de 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
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
On Wed, 04 Aug 2010 17:47:12 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
However the rule is still the same when using an unsafe
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:47:12 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
However the rule is still the
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
Ivan Lazar Miljenovic schrieb:
Yitzchak Gale g...@sefer.org 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
On Wed, Aug 4, 2010 at 9:21 AM, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
Ivan Lazar Miljenovic schrieb:
Yitzchak Gale g...@sefer.org writes:
While useful, I think its ubiquity to simplicity ratio is not
high enough to justify either depending on MissingH
just for that, or
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 f...@informatik.uni-kiel.dewrote:
Hi,
DSTM is an implementation of a robust distributed Software Transactional
Memory (STM) library for Haskell. Many real-life applications
On Tue, Aug 3, 2010 at 8:33 PM, Claude Heiland-Allen
claudiusmaxi...@goto10.org 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) $
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.
On Wed, Aug 4, 2010 at 1:00 AM, Mark Lentczner ma...@glyphic.com 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,
Charles-Pierre Astolfi c...@crans.org 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
Ertugrul Soeylemez e...@ertes.de 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/
On Wed, 04 Aug 2010 18:04:13 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:47:12 +0200, Janis Voigtländer
j...@informatik.uni-bonn.de wrote:
Nicolas Pouillard schrieb:
On Wed, 04 Aug 2010 17:27:01 +0200, Janis Voigtländer
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 c...@crans.org wrote:
Hey there,
I'm searching for software designs in Haskell ; for
On 4 August 2010 10:43, Chris Eidhof ch...@eidhof.nl 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
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 18:40, Alexander Dunlap alexander.dun...@gmail.com 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
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
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 use
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
On Tue, Aug 3, 2010 at 8:23 AM, Felipe Lessa felipe.le...@gmail.com wrote:
On Tue, Aug 3, 2010 at 8:01 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Felipe Lessa felipe.le...@gmail.com writes:
'hierarchical-clustering' provides a function to create a dendrogram
from a list of
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
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
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
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
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 f...@informatik.uni-kiel.dewrote:
John,
a very nice idea. I have not worked with
On Wed, Aug 4, 2010 at 3:37 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Marc Weber marco-owe...@gmx.de 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
On Aug 3, 8:31 pm, Jeremy Shaw jer...@n-heptane.com 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
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 meantime
On Wed, 4 Aug 2010, Stephen Sinclair wrote:
On Aug 3, 8:31 pm, Jeremy Shaw jer...@n-heptane.com 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,
On Wed, Aug 4, 2010 at 2:11 AM, Magnus Therning mag...@therning.org wrote:
On Wed, Aug 4, 2010 at 06:00, Mark Lentczner ma...@glyphic.com 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
+ 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
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
Christopher Done chrisd...@googlemail.com writes:
On 4 August 2010 10:43, Chris Eidhof ch...@eidhof.nl 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
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 spoil
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
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
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.
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 om...@smileystation.com wrote:
Why is toRational a method of Real? I thought that real numbers need not
be rational, such as the square
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 classes
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
On 5 August 2010 10:15, Lennart Augustsson lenn...@augustsson.net 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
-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
- --
On Wed, Aug 4, 2010 at 1:36 AM, Ben Millwood hask...@benmachine.co.uk wrote:
On Sun, Jul 18, 2010 at 3:02 AM, Mark Wotton mwot...@gmail.com 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
-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 in
On 5 August 2010 13:23, Mark Wotton mwot...@gmail.com 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
1 - 100 of 108 matches
Mail list logo
