Am Mittwoch, 11. Februar 2009 22:38 schrieben Sie:
On 12 Feb 2009, at 1:40 am, Wolfgang Jeltsch wrote:
Am Mittwoch, 11. Februar 2009 00:46 schrieben Sie:
I suppose I should point out what seems obvious to me, which is
that one
could embed a substantial chunk of MathML (possibly all
Am Mittwoch, 11. Februar 2009 20:45 schrieb Gwern Branwen:
Here are the projects I favor (in no particular order):
[…]
* A GUI interface to Darcs
(http://hackage.haskell.org/trac/summer-of-code/ticket/17); this could
possibly be based on TortoiseDarcs http://tortoisedarcs.sourceforge.net/.
Am Mittwoch, 11. Februar 2009 23:02 schrieb Corey O'Connor:
The way I read changes in version numbers for a scheme using the
format X.Y.Z is:
* A change in Z indicates bug fixes only
* A change in Y indicates the interface has changed but not in an
incompatible way. For instance, maybe a
Am Mittwoch, 11. Februar 2009 18:51 schrieb Don Stewart:
For example, if all the haddocks on hackage.org were a wiki, and
interlinked, every single package author would benefit, as would all
users.
You mean, everyone should be able to mess about with my documentation? This
would be similar to
Am Donnerstag, 12. Februar 2009 09:20 schrieb Achim Schneider:
Wolfgang Jeltsch g9ks1...@acme.softbase.org wrote:
Am Mittwoch, 11. Februar 2009 18:51 schrieb Don Stewart:
For example, if all the haddocks on hackage.org were a wiki, and
interlinked, every single package author would
Am Donnerstag, 12. Februar 2009 09:15 schrieben Sie:
g9ks157k:
Am Mittwoch, 11. Februar 2009 18:51 schrieb Don Stewart:
For example, if all the haddocks on hackage.org were a wiki, and
interlinked, every single package author would benefit, as would all
users.
You mean, everyone
Am Donnerstag, 12. Februar 2009 10:49 schrieb Luke Palmer:
Something like AnnoCPAN would be a good middle-ground here; i.e.
differentiate between official package documentation and user
annotations, but make them both visible.
And give visitors of the Hackage website the choice to not see the
Am Donnerstag, 12. Februar 2009 15:34 schrieb Thomas DuBuisson:
Daniel Kraft asked:
That sounds interesting... What do you mean by no canonical library?
Are there already ones but just no standard one? But in this case, I
don't think adding yet another one will help :D Or isn't there a
or criticism, please get in touch with me.
Wolfgang Jeltsch
Principal Grapefruit developer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Am Freitag, 13. Februar 2009 01:30 schrieben Sie:
On 12 Feb 2009, at 8:48 pm, Wolfgang Jeltsch wrote:
I don’t understand this. The way which works is conversion from
MathML to TeX.
So your suggestion would be to use MathML as the source language.
But this is
obviously not what you
Am Samstag, 14. Februar 2009 16:59 schrieb Brent Yorgey:
On Thu, Feb 12, 2009 at 04:10:21PM +0100, Wolfgang Jeltsch wrote:
Am Donnerstag, 12. Februar 2009 15:34 schrieb Thomas DuBuisson:
Get a community.haskell.org account once you are ready to start a
repo, it can not only host your repo
Am Freitag, 13. Februar 2009 17:16 schrieb Peter Verswyvelen:
Can all functional dependencies be completely replaced with associated
types when using GHC 6.10.1?
It might be possible as long as you don’t use overlapping instances. With
overlapping instances, it’s typically not possible since
Am Sonntag, 15. Februar 2009 23:00 schrieb Peter Verswyvelen:
But if I understand it correctly, dependent types are a bit like that,
values and types can inter-operate somehow?
With dependent types, parameters of types can be values. So you can define a
data type List which is parameterized by
Am Sonntag, 15. Februar 2009 17:50 schrieb Peter Verswyvelen:
I'm having trouble understanding the explanation of the meaning of the
signature of runST
Were you just reading the documentation of Grapefruit’s era parameters or why
are you studying ST? ;-)
Best wishes,
Wolfgang
[redirecting to haskell-cafe]
Am Samstag, 14. Februar 2009 23:13 schrieben Sie:
Great, does it run well on Windows and Mac platforms in addition to Linux
platform which should run fine?
Actually, I have no idea. ;-)
Well, Grapefruit is a pure Haskell library without any own binding to C
[redirecting to haskell-cafe]
Am Sonntag, 15. Februar 2009 00:25 schrieben Sie:
Hi Wolfgang,
I was wondering if I can use FLTK as GUI backend for Grapefruit?
This should be possible in principal. It just could be that my assumptions
about how widgets are created and composed were too tight
[redirecting to haskell-cafe]
Am Sonntag, 15. Februar 2009 00:26 schrieben Sie:
One more thing, would Grapefruit work with files created by Glade (UI
builder)?
No, it won’t, I’m afraid. There is, for example, the principal problem that
Glade is GTK+-specific (as far as I know) while
Am Sonntag, 15. Februar 2009 16:27 schrieben Sie:
Hi Wolfgang,
Thank you for the excellent introduction
Oh, I thought that you didn’t send you original question to the list and
therefore answered you only privately. So the others don’t know yet the
introduction you refer to (but see below).
Am Samstag, 14. Februar 2009 23:37 schrieb Roman Cheplyaka:
* Wolfgang Jeltsch g9ks1...@acme.softbase.org [2009-02-14 17:19:09+0100]
Dear friends of Haskell and Functional Reactive Programming,
its my pleasure to announce the first official release of Grapefruit, a
library for Functional
Am Montag, 16. Februar 2009 13:07 schrieb Neil Mitchell:
Hi Henk-Jan,
I believe cabal adds a -O on the command line, perhaps try ghc --make
-O (after deleting all object files)
If it’s the -O option what causes the loop then it is problably because of
this:
Am Montag, 16. Februar 2009 14:21 schrieben Sie:
Aha! Wolfgang is a man who knows his own code :)
Yes, I've seen this a couple of times but when I saw it again in
Grapefruit, I wanted to know how this usage of existentials worked, since
I'm sooo curious to find out how you managed to use the
Am Montag, 16. Februar 2009 15:13 schrieben Sie:
So I have an application that I am developing. The UI module includes
the following:
import Graphics.UI.Gtk
import Graphics.Rendering.Cairo
import Graphics.Rendering.Cairo.SVG
import Graphics.UI.Gtk.Gdk.EventM
Can you tell from that list if
Am Montag, 16. Februar 2009 16:43 schrieb Peter Verswyvelen:
2009/2/16 Gour g...@mail.inet.hr
Do you anticipate that Grapefruit will be capable for writing real-world
GUI apps quit soon?
LOL. Funny typo. If the apps quit soon we're in trouble! :-)
I’m sure that current Grapefruit
Am Montag, 16. Februar 2009 16:27 schrieb Gour:
Do you anticipate that Grapefruit will be capable for writing real-world
GUI apps quit soon?
I have no concrete anticipation. It depends very much on the community. If
there is notable interest and this interest makes people hacking on
Am Montag, 16. Februar 2009 17:46 schrieb Wolfgang Jeltsch:
Am Montag, 16. Februar 2009 16:27 schrieb Gour:
Do you anticipate that Grapefruit will be capable for writing real-world
GUI apps quit soon?
I have no concrete anticipation. It depends very much on the community
Am Montag, 16. Februar 2009 18:05 schrieb Fraser Wilson:
I'd love to hack on Grapefruit.
That’s great!
I'll do some study (and take a break from my own world-changing functional
GUI :-)
I tried to check out your repository at
http://thewhitelion.org/darcs/barrie/
but darcs get failed
Am Montag, 16. Februar 2009 19:08 schrieben Sie:
Yeah, I lack some darcs fu unfortunately. I understood it was just a
matter of copying a repository. I'll have a look, and by have a look
I mean bother #haskell :-)
If you don’t use this lazy fetch feature (or whatever it is called) then you
Am Montag, 16. Februar 2009 19:04 schrieb Kim-Ee Yeoh:
Despite its rank-2 type, runST really doesn't have anything to do with
existential quantification.
First, I thought so too but I changed my mind. To my knowledge a type
(forall a. T[a]) - T' is equivalent to the type exists a. (T[a] - T').
Am Montag, 16. Februar 2009 19:22 schrieb Wolfgang Jeltsch:
Am Montag, 16. Februar 2009 19:04 schrieb Kim-Ee Yeoh:
Despite its rank-2 type, runST really doesn't have anything to do with
existential quantification.
First, I thought so too but I changed my mind. To my knowledge a type
Am Montag, 16. Februar 2009 19:27 schrieben Sie:
Ah. Copy, don't darcs get.
If you copy a repository which was itself fetched from somewhere using this
lazy patch fetching feature, you’ll probably experience problems too. If it’s
the repository you work in and you never fetched any patches
Am Dienstag, 17. Februar 2009 01:13 schrieb Martijn van Steenbergen:
Daniel Kraft wrote:
Do you think something would be especially nice to have and is currently
missing?
Have type class aliases been implemented yet? This proposal (or parts or
it) seems like a very useful compiler
Am Dienstag, 17. Februar 2009 00:32 schrieb George Pollard:
On Mon, 2009-02-16 at 15:30 +0100, Fraser Wilson wrote:
Super! Also, best definition of bottom I've yet seen -- ignoring _|
_, which is a party pooper. Like good code, it's short, to the
point, and obviously correct.
This
Am Dienstag, 17. Februar 2009 03:42 schrieb Isaac Dupree:
I'm really confused that when I replied (not reply-to-all, not
reply-to-list, just reply) to that message, it went to the lists and not to
you Brent! (KMail 1.10.3) -- so I totally edited the To lines, to send
this message...
Isn’t
Am Montag, 16. Februar 2009 21:33 schrieb Henk-Jan van Tuyl:
On Mon, 16 Feb 2009 14:56:01 +0100, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Montag, 16. Februar 2009 13:07 schrieb Neil Mitchell:
Hi Henk-Jan,
I believe cabal adds a -O on the command line, perhaps try ghc --make
Am Montag, 16. Februar 2009 22:04 schrieben Sie:
As for how I want Hieroglyph to work interactively, I think the easiest way
is to react to the input data considered as a coherent whole. The semantic
model for visualization is that a Visualization is a function from Data to
Visual.
Hmm,
Am Montag, 16. Februar 2009 22:43 schrieben Sie:
* Wolfgang Jeltsch g9ks1...@acme.softbase.org [2009-02-16 14:51:18+0100]
Maybe there is someone interested in helping me with the graphics
support? There is already quite some stuff implemented (thanks to
Matthias Reisner), it’s just
Am Dienstag, 17. Februar 2009 14:42 schrieb Peter Verswyvelen:
Tuples in Haskell always have annoyed me a bit since each tuple of
different dimension is hardcoded
You are not alone with this. Several people have complained about this in the
past.
(I guess compilers enforce a maximum
Hello,
for Grapefruit’s incremental list signal support, I needed a type class of
semigroups. A semigroup is similar to a monoid. The difference is that a
semigroup doesn’t need to have a neutral element. So a semigroup type class
would make a perfect superclass of Monoid, by the way.
Since a
Am Dienstag, 17. Februar 2009 17:18 schrieben Sie:
I'm glad that FRP isn't still alive and kicking.
You are glad that FRP is *not* alive? Okay, this was a typo, wasn’t it? ;-)
I hope you will support wxHAskell in the near future. I tried wxFruit and I
liked it, but it isn't complete and it
Am Dienstag, 17. Februar 2009 19:36 schrieben Sie:
If you have problems with Gtk2Hs on Windows, it might be better to write
a Win32-based backend for Grapefruit instead of a wxWidgets-based one.
What do you think about that?
Win32-based backend would make more sense as it is one less layer
Am Dienstag, 17. Februar 2009 21:01 schrieben Sie:
Wolfgang Jeltsch wrote:
* making Applicative a superclass of Monad
* getting rid of MonadPlus (use (Alternative m, Monad m) instead of
(MonadPlus m) or, with another extension, even something like
(forall a. Monoid (m
Am Mittwoch, 18. Februar 2009 10:54 schrieb Eric Kow:
The first is to work towards a sort of graphical interface for darcs (as
has been suggested on this list). I suspect that we what we will likely
do with this idea is to refine it into something that may either be
part of a GUI (like a
Am Mittwoch, 18. Februar 2009 15:42 schrieben Sie:
When he gives you the code, could you let me know? I would really
love to bind Open Scene Graph, but it's entirely C++ and that makes
for a lot more difficult coding to say the least.
Yes, I will let you know.
Best wishes,
Wolfgang
Am Donnerstag, 19. Februar 2009 02:22 schrieb sylvain:
Haskell is a nice, mature and efficient programming language.
By its very nature it could also become a nice executable formal
specification language, provided there is tool support.
Wouldn’t it be better to achieve the goals you describe
Am Donnerstag, 19. Februar 2009 00:17 schrieben Sie:
On Tue, 17 Feb 2009, Wolfgang Jeltsch wrote:
Now, a package only for one class with one method seems like overkill.
However, it could serve as a start for a package of all kinds of
algebraic structures. So I called the package “algebra
Am Donnerstag, 19. Februar 2009 05:10 schrieben Sie:
Wolfgang Jeltsch wrote:
I’ve put myself as a potential mentor on the old Haskell SoC ticket
(http://hackage.haskell.org/trac/summer-of-code/ticket/17). However,
one or two years ago I was told that mentoring is a very time-consuming
Am Donnerstag, 19. Februar 2009 11:35 schrieb Alberto G. Corona:
2009/2/19 Wolfgang Jeltsch g9ks1...@acme.softbase.org
Am Donnerstag, 19. Februar 2009 02:22 schrieb sylvain:
Haskell is a nice, mature and efficient programming language.
By its very nature it could also become a nice
Am Donnerstag, 19. Februar 2009 12:37 schrieb Malcolm Wallace:
Unless Google's changed things, the organization gets 500$ for each
project. What the Darcs organization does with that, who knows.
Yes, who knows. The Haskell organization didn't give a cent
to the mentors, as far as I
Am Donnerstag, 19. Februar 2009 14:50 schrieb John A. De Goes:
Unfortunately the proofs in dependently typed languages are
extremely long and tedious to write. Some kind of compiler proofing
tool could ease the pain, but I do not think it has low enough
complexity for a GSoC project.
I was
Am Freitag, 20. Februar 2009 00:38 schrieben Sie:
Wolfgang Jeltsch schrieb:
Am Donnerstag, 19. Februar 2009 00:17 schrieben Sie:
Do you mean this one: http://haskell.org/haskellwiki/Numeric_Prelude?
There is currently no code for this, is there?
http://hackage.haskell.org/cgi-bin
Am Freitag, 20. Februar 2009 09:42 schrieben Sie:
Hello,
but to specify that “this function turns a list into its sorted equivalent”
would probably require to specify e.g. sort in terms of the type system
and to write code that actually does the sorting. The first task is much
like
Am Samstag, 21. Februar 2009 16:18 schrieb Eric Kow:
Hi Wolgang,
Hmm, wrong again. ;-)
On Wed, Feb 18, 2009 at 12:53:23 +0100, Wolfgang Jeltsch wrote:
What do you mean with “something which will make it much easier for third
parties to write a GUI in the future”?
Kari's example of GUI
Hello,
on http://www.haskell.org/haskellwiki/Hac5/Projects, you can list a project
under “Project descriptions” and under “Experiences”. What’s the difference?
Best wishes,
Wolfgang
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Am Dienstag, 24. Februar 2009 09:30 schrieb Aaron Denney:
On 2009-02-19, Wolfgang Jeltsch g9ks1...@acme.softbase.org wrote:
In addition, I wouldn’t include algebraic structures in a
*numerical* prelude since the cool thing about them is that they are
so abstract that they are not only about
Am Mittwoch, 25. Februar 2009 14:33 schrieb Duncan Coutts:
Note that some people will tell you that by a strict interpretation of
the LGPL that statically linked Haskell libs under that license are a
pain in the backside. When we decided on that license for gtk2hs that
was not our intention.
Hello,
I created a mailing list for Grapefruit on the Haskell Community Server
(grapefr...@projects.haskell.org). If I try to subscribe to it, I receive a
confirmation e-mail but my answers to this e-mail seem to get ignored. Does
anyone have an idea what’s wrong here?
Best wishes,
Wolfgang
Am Mittwoch, 25. Februar 2009 17:05 schrieb Wolfgang Jeltsch:
Hello,
I created a mailing list for Grapefruit on the Haskell Community Server
(grapefr...@projects.haskell.org). If I try to subscribe to it, I receive
a confirmation e-mail but my answers to this e-mail seem to get ignored.
Does
Am Mittwoch, 25. Februar 2009 17:15 schrieb Wolfgang Jeltsch:
Am Mittwoch, 25. Februar 2009 17:05 schrieb Wolfgang Jeltsch:
Hello,
I created a mailing list for Grapefruit on the Haskell Community Server
(grapefr...@projects.haskell.org). If I try to subscribe to it, I
receive
Hello,
I just want to mention that the Grapefruit FRP library now has a mailing list
and a Trac instance which contains a bug tracker. See:
http://www.haskell.org/haskellwiki/Grapefruit#Community
Please also note that the Grapefruit repositories have moved to
code.haskell.org.
Best
Am Mittwoch, 25. Februar 2009 23:38 schrieb Peter Hercek:
So my opinion (IAMNAL):
1) source code under very limiting commercial license (just to allow
recompile with a newer LGPL lib and nothing else) is OK
2) it is probable that only the *.o, *.hi files and a linking script are
OK too
I
Am Donnerstag, 26. Februar 2009 09:17 schrieb Ketil Malde:
Peter Hercek pher...@gmail.com writes:
Relinking against newer Gtk2Hs versions might not work.
You have the option of recompiling the new Gtk2Hs with the old GHC and
relinking, don't you?
Relinking is technically not possible
Am Donnerstag, 26. Februar 2009 21:39 schrieb Peter Hercek:
The acceptable size of inlined fuctions for a C code is about 10 lines.
I did not read any info how it would be for Haskell.
At least, GHC inlines very massively, to my knowledge. And I think you need
this massive inlining for
Am Donnerstag, 26. Februar 2009 20:20 schrieb Achim Schneider:
Wolfgang Jeltsch g9ks1...@acme.softbase.org wrote:
Am Donnerstag, 26. Februar 2009 09:17 schrieb Ketil Malde:
Peter Hercek pher...@gmail.com writes:
Relinking against newer Gtk2Hs versions might not work.
You have
Am Sonntag, 1. März 2009 22:10 schrieb Brian Bloniarz:
Hi George,
Since none of the type metaprogramming specialists have answered you
on-list, I took a crack at this -- I think you can work around the issue by
avoiding overlapping instances entirely. I learned about this technique
from the
Am Freitag, 6. März 2009 14:34 schrieb Daniel Bünzli:
without using recursive signal functions,
If this is because there's this limitation in the frp system you use
It is.
then better fix the system.
The system is Grapefruit, by the way. And I’m its developer, by the way. :-)
I have to
Am Freitag, 6. März 2009 17:51 schrieb Wolfgang Jeltsch:
By the way, the adress of the Grapefruit mailing list is
grapefr...@projects.haskell.org, not grapefr...@haskell.org.
Oh, this is really strange: I addressed my e-mail to
grapefr...@projects.haskell.org but the version arriving
Am Freitag, 6. März 2009 17:57 schrieb Wolfgang Jeltsch:
Am Freitag, 6. März 2009 17:51 schrieb Wolfgang Jeltsch:
By the way, the adress of the Grapefruit mailing list is
grapefr...@projects.haskell.org, not grapefr...@haskell.org.
Oh, this is really strange: I addressed my e-mail
Am Samstag, 7. März 2009 18:49 schrieb Roman Cheplyaka:
Great! I'll have more free time after March 15, and we can arrange an
IRC meeting to discuss this.
I’d be happy if you would also invite me to this IRC meeting when it will
finally happen.
Best wishes,
Wolfgang
Am Dienstag, 10. März 2009 00:59 schrieb Joe Fredette:
Hehe, I love it. Sloth is a synonym for Lazyness in English too, and
they're so freaking cute... :)
Same in German: The german “Faultier” means “lazy animal”.
Best wishes,
Wolfgang
___
Maybe you should direct your question to the Gtk2Hs users mailing list
gtk...@lists.sourceforge.net.
Best wishes,
Wolfgang
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Am Donnerstag, 12. März 2009 22:00 schrieb Martijn van Steenbergen:
Deniz Dogan wrote:
Then of course,
there's the downside that there's no connection to the language itself
in any way.
I usually go for names that don't have to do anything with the
application itself: GroteTrap
Am Freitag, 13. März 2009 04:29 schrieb Benjamin L.Russell:
Consider the following logo:
Silver red monad.png
http://commons.wikimedia.org/wiki/File:Silver_red_monad.png
Can’t we choose something which is not connected to certain worldviews?
Best wishes,
Wolfgang
Am Freitag, 13. März 2009 05:09 schrieb Denis Bueno:
This works because every monad induces an Applicative instance in a
way I've ingested just enough wine to forget. =]
pure = return
(*) = ap
Best wishes,
Wolfgang
___
Haskell-Cafe mailing list
Am Freitag, 13. März 2009 04:01 schrieb Alexander Dunlap:
2. Use the type
data Natural = Zero | Succ !Natural
[…]
In terms of speed, I think that [3] would be reasonably fast (unless
you do a ton of subtraction with bounds-checking) and [2] would
probably be quite slow, because you
Am Freitag, 13. März 2009 04:53 schrieb Brandon S. Allbery KF8NH:
On 2009 Mar 12, at 22:54, Mark Spezzano wrote:
I was wondering what the best way to implement Natural number would
be. Is there a package which already does this?
type-level on Hackage.
I think, the original poster wanted
Am Freitag, 13. März 2009 09:21 schrieb Roman Cheplyaka:
* Alexander Dunlap alexander.dun...@gmail.com [2009-03-12 20:01:57-0700]
Also, a lot of functions just take
Integers so it would be more of a pain to use.
AFAIK there are very few fuctions that take Integers. Many functions
take
Am Samstag, 14. März 2009 08:19 schrieb Peter Verswyvelen:
Well, in C++ one can already use the numerical values with templates for
achieving a lot of compile time computations.
So I would be very happy to have this feature in Haskell. It might also be
good research towards full dependent
Am Samstag, 14. März 2009 14:51 schrieb Conor McBride:
Conor, is Epigram currently under development?
We've even stopped working on the engine and started working on the chassis.
I'm in an intensive teaching block until the end of April, but from May it
becomes Priority. The Reusability and
Am Samstag, 14. März 2009 23:33 schrieben Sie:
On Fri, 13 Mar 2009, Wolfgang Jeltsch wrote:
Class instances should satisfy certain laws. (Although these laws are
often not stated explicitely, they are assumed to hold by users of the
class and they should hold to make the instance sensible
Am Dienstag, 17. März 2009 05:09 schrieb wren ng thornton:
a...@spamcop.net wrote:
Or to put it another way, category theory is the pattern language of
mathematics.
Indeed. Though, IMO, there's a distinction between fairly banal things
(e.g. monoids),
Monoids aren’t a concept of category
Am Dienstag, 17. März 2009 10:54 schrieben Sie:
Wolfgang Jeltsch g9ks1...@acme.softbase.org writes:
By the way, the documentation of Control.Category says that a category is
a monoid (as far as I remember). This is wrong. Category laws correspond
to monoid laws but monoid composition
Am Dienstag, 17. März 2009 11:49 schrieb Yandex:
data (a :=: a') where
Refl :: a :=: a
Comm :: (a :=: a') - (a' :=: a)
Trans :: (a :=: a') - (a' :=: a'') - (a :=: a'')
I don’t think, Comm and Trans should go into the data type. They are not
axioms but can be proven. Refl says that each
Am Dienstag, 17. März 2009 16:32 schrieben Sie:
On Tue, 2009-03-17 at 13:06 +0100, Wolfgang Jeltsch wrote:
A category is not a “generalized monoid” but categories (as a concept)
are a generalization of monoids. Each category is a monoid, but not the
other way round.
You mean ``each monoid
Am Dienstag, 17. März 2009 18:43 schrieben Sie:
On Tue, Mar 17, 2009 at 5:06 AM, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
What is a “generalized monoid”? According to the grammatical construction
(adjective plus noun), it should be a special kind of monoid
There's
Am Mittwoch, 18. März 2009 05:36 schrieb wren ng thornton:
Wolfgang Jeltsch wrote:
Am Dienstag, 17. März 2009 10:54 schrieben Sie:
I'm reading the Barr/Wells slides at the moment, and they say the
following:
Thus a category can be regarded as a generalized monoid,
What
Am Dienstag, 17. März 2009 21:51 schrieben Sie:
On Tue, Mar 17, 2009 at 6:14 AM, Wolfgang Jeltsch wrote:
Am Dienstag, 17. März 2009 11:49 schrieb Yandex:
data (a :=: a') where
Refl :: a :=: a
Comm :: (a :=: a') - (a' :=: a)
Trans
Am Dienstag, 17. März 2009 16:55 schrieb Eelco Lempsink:
We'll see. Worst case: nobody votes (with 123 votes at this moment, I
don't think that will be the problem). Second worst case: most people
don't have/take the time to order a bit, so it turns into a majority
vote.
Or there are many
Am Mittwoch, 18. März 2009 10:03 schrieb Benjamin L.Russell:
Just go through the list, choose your top favorite, and assign rank 1
to it;
Is rank 1 the best or the worst?
I thought it would be the worst so I would probably have voted exactly the
opposite way than I wanted to. :-(
Best
Am Dienstag, 17. März 2009 21:08 schrieb Robin Green:
However, I am now hacking together a quick-and-dirty utility for
ranking things which I will put on hackage. I'm not sure that anyone
other than myself will use it, but it's fun hacking it up.
If you announce it on the mailing list, I might
Am Mittwoch, 18. März 2009 03:22 schrieb Robin Green:
I'm afraid it is entirely terminal-based (i.e. text only), so it doesn't
show the pictures.
Hmm, this doesn’t help me since I’ve already written a terminal-based app. See
attachement. However, no guarantees that this app works as intended.
Am Mittwoch, 18. März 2009 13:31 schrieben Sie:
On Wed, Mar 18, 2009 at 04:36, Wolfgang Jeltsch wrote:
Am Mittwoch, 18. März 2009 10:03 schrieb Benjamin L.Russell:
Just go through the list, choose your top favorite, and assign rank 1
to it;
Is rank 1 the best or the worst
Am Donnerstag, 19. März 2009 03:53 schrieb Benjamin L.Russell:
Therefore, rank 1 is the best.
This is quite the opposite of what Denis Bueno said. :-(
Best wishes,
Wolfgang
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Am Mittwoch, 18. März 2009 15:17 schrieben Sie:
Wolfgang Jeltsch schrieb:
Okay. Well, a monoid with many objects isn’t a monoid anymore since a
monoid has only one object. It’s the same as with: “A ring is a field
whose multiplication has no inverse.” One usually knows what is meant
Am Donnerstag, 19. März 2009 13:58 schrieben Sie:
An easier idea to think about would be to categorize most adjectives
applied to mathematical constructs into traits and cotraits.
A trait refines a notion and a cotrait broadens the definition.
When talking about a commutative ring,
Am Freitag, 10. April 2009 18:41 schrieb Patai Gergely:
is based on some unsafePerformIO dark magic (that might easily break
depending on many factors)
I wonder if this breaks referential transparency. Say, you define a signal s
and use s twice in some expression. s may be evaluated once and
Am Dienstag, 14. April 2009 11:33 schrieb Patai Gergely:
and then the integration of a Grapefruit-like and a Reactive-like system
could be the ultimate solution in the long run.
What do you think, Grapefruit is lacking, compared to Reactive?
Best wishes,
Wolfgang
Am Samstag, 11. April 2009 16:57 schrieb Patai Gergely:
Any idea how Elerea compares to Grapefruit? It's great to see a lot of
competition in the FRP arena, but I hope in the end this results in a
really usable and scalable FRP system for Haskell :-)
I think Wolfgang can judge this better,
Am Mittwoch, 15. April 2009 09:03 schrieb Achim Schneider:
I don't think using dirty tricks to implement FRP deserves flak, at
all, from my POV, it sounds like complaining that the IO monad is
implemented using C... meaning that if you're that close to bare
thunks, you have every right to use
Am Dienstag, 14. April 2009 20:01 schrieb Tillmann Rendel:
How is the need for a common import for 'data TTrue; data TFalse'
different then the need for a common import for 'data Bool = True | False'?
Why not say
data True
data False,
instead of
data TTrue
data TFalse?
I
Hi,
I have a freshly installed Haskell Platform 2010.2.0.0 on Windows 7.
When I run ghc-pkg list, I get the following message (besides the
expected package info):
WARNING: cache is out of date: C:/Program Files (x86)/Haskell
Platform/2010.2.0.0\lib\package.conf.d\package.cache
use
701 - 800 of 812 matches
Mail list logo
