this might be useful:
http://muitovar.com/gtk2hs/app1.html (There's a Spanish translation
too.) However, this tutorial is a few years old now, and I don't know if
it's still up to date for the later Gtk2Hs versions.
Best Regards,
Hans van Thiel
That's interesting, writing a DSL that compiles to C. I've actually
inerviewed Gerard Holzamann twice, the first time when he received the
ACM Software System Award in 2002 [1] and in 2008 after he moved to JPL
[2]. What they use to test distributed software is the Process Meta
Language (Promela)
Registration Number: 368047
I think this is interesting even to those who are not looking for a job
right now, since it shows the current mind-set regarding Haskell, at a
major and leading IT company.
Best Regards,
Hans van Thiel
___
Haskell-Cafe
with the results. All comments most
welcome...
Emping is a (prototype) interactive tool for the discovery and analysis
of (universal, not statistical) predictive rules in tables of nominal
data.
Best Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe
unintuitive.
Hi,
The only place I've ever seen Kleisli composition, or its flip, used is
in demonstrating the monad laws. Yet it is so elegant and, even having
its own name, it must have some practical use. Do you, or anybody else,
have some pointers?
Best Regards,
Hans van Thiel
- Jake
to the others who've replied. I've wondered about
(=) usage for a long time too, and this is all very illuminating. I'll
work this through and put it in my monad tutorial, if I may (without
implicating you guys in any way, of course, unless you insist...)
Regards,
Hans van Thiel
[snip
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
reply!
Best Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sat, 2008-12-27 at 11:54 -0600, Jake McArthur wrote:
Hans van Thiel wrote:
However, some functions in Haskell may have side effects, like printing
something on the screen, updating a database, or producing a random
number. These functions are called 'actions' in Haskell.
Not really
/articles/monads.html
Greets,
Ertugrul.
Looks pretty good to me! Could you add a link in the Haskell tutorials
section?
Best Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
composition is
a useful method of generalization, which, by the way, allows you to
isolate side effects in a controlled manner'.
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
? The types of c or
str are pretty clear, aren't they?
Just something that's been puzzling me for some time now...thanks.
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Spin
and its principles.
Best Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
problems with new GHC releases and
Gtk2Hs. These have always been addressed, but it usually took a few
months..
Cheers,
Hans van Thiel
[snip]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
[snip]
Most probably you are confusing type and data constructor. This is a common
error and a hurdle I remember falling over more than once. It is due to the
fact that in Haskell both are in completely separate name spaces,
nevertheless both use capitalized names. Thus people often use the
On Mon, 2008-08-25 at 00:33 +0200, Ben Franksen wrote:
Hans van Thiel wrote:
so 'The Greenhorn's Guide to becoming a Monad Cowboy' is on
http://www.muitovar.com/monad/moncow.xhtml
Forgot to say: nicely written!
Some more comments:
You can declare a fixity (infixr) for flop instead
Hello All,
I'm proud to announce the first monad tutorial of the new season. It's
under the Wiki permissive licence, but the web page has some clip art,
so 'The Greenhorn's Guide to becoming a Monad Cowboy' is on
http://www.muitovar.com/monad/moncow.xhtml
Best Regards,
Hans van Thiel
mailing list. Either comment on the nice gentlemen's
PHP closure proposal from a language point of view, or don't say anything.
Jules
Hear, hear...
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
[snip]
The current a priori check, which said there were no fatal errors, while the
a posteriori check failed, is misleading. Wouldn't it be better to warn
potential
uploaders that this first check is not complete?
I'm not sure I see what you're getting at. We can't do a full build
). So, if an uploader knows such
dependencies, how to express them?
Thanks in advance,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and a
few screenshots.
Thank you all,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
for Linux, with documentation, can also be
downloaded directly from my web site.
Thank you,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Wladiwostok, both
female and under 25 years of age. They programmed in C and were highly
respected by their managers and colleagues! So, there are at least
counterexamples :-)
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe
The translator of both texts prefers to be known as Laszlo Keuschnig. In
case anyone wonders, this is not me, though I wish..
Best Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
On Wed, 2007-12-12 at 16:27 +0100, Hans van Thiel wrote:
[snip]
I fear those people can do vast amounts of damage. :(
When inept programming yields the wrong result, it is clear (even to the
inept) that the program is bad.
When the result is correct but there are egregious time
the writer look smart and
important, but to ease things for the reader. I wouldn't want to exclude
the scurrilous unwashed from the Haskell experience, this close to
Christmas, too. :-)
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe
On Tue, 2007-12-11 at 16:56 +0100, Wolfgang Jeltsch wrote:
Am Dienstag, 11. Dezember 2007 14:46 schrieb Hans van Thiel:
On Mon, 2007-12-10 at 20:00 +0100, Henning Thielemann wrote:
[snip]
I raise my question once again: Must Haskell's tutorials be tailored to
impatient programmers
, please don't hesitate to comment and report
errors.
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, though, just heard of it.
Regards,
Hans van Thiel
Any link to tools or methods that could help me in that task would be
greatly appreciated. I already searched for fuzzy, probabilistic or
statistical parsing but without much success.
Thanks,
Olivier.
PS: just in case someone's
for smaller values. In all cases the actual precision of sin
appears to be 4 to 5 decimals, and results should be rounded to that
before using them. Now I'm wondering about cos, tan and also the
inverses, asin etc. :-)
Regards,
Hans van Thiel
Hugs sin (1.000 * pi)
1.22460635382238e-16
Hugs sin (0.999
On Sat, 2007-11-10 at 11:14 -0800, David Roundy wrote:
On Sat, Nov 10, 2007 at 06:56:23PM +0100, Hans van Thiel wrote:
Thanks to all who've replied; Carl's explanation in particular was very
interesting. So the precision, suggested by the many decimals in the
'show', is not the actual
Hello All,
Can anybody explain the results for 1.0, 2.0 and 3.0 times pi below?
GHCi yields the same results. I did search the Haskell report and my
text books, but to no avail. Thanks in advance,
Hans van Thiel
Hugs sin (0.0 * pi)
0.0
Hugs sin (0.5 * pi)
1.0
Hugs sin (1.0 * pi)
1.22460635382238e
On Fri, 2007-11-09 at 14:30 -0500, Brent Yorgey wrote:
On Nov 9, 2007 2:08 PM, Hans van Thiel [EMAIL PROTECTED] wrote:
Hello All,
Can anybody explain the results for 1.0, 2.0 and 3.0 times pi
below?
GHCi yields the same results. I did search the Haskell
. The
same applies to the port. Moreover, advanced widgets like Tree List are
large and complicated and will not be treated at all.
Note 3: This tutorial, and in particular the 'Getting Started' chapter,
replaces the old 'Getting Started' page, which has been removed.
Many Thanks,
Hans van Thiel
you could talk to some of those people.
What I know is that it is being deployed other than in open source, but
that fact is not being advertised in the marketing.
Maintainability should be excellent in Haskell,
due to the fine grained modularity without side effects.
Best Regards,
Hans van Thiel
dependent on how well the data is structured.
Obviously, much has still to be done.
More info, for those who are interested, on
http://j-van-thiel.speedlinq.nl/emp/empug.html
Thank you,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe
On Fri, 2007-06-29 at 19:35 +0200, Thomas Schilling wrote:
On 27 jun 2007, at 18.41, Hans van Thiel wrote:
[snip]
Thanks, Apfelmus, for the references. Guess I'll start there, then.
And
thanks, Chris, for the info and code. Read only 'up pointers' could be
what is needed
[snip]
Thanks, Apfelmus, for the references. Guess I'll start there, then. And
thanks, Chris, for the info and code. Read only 'up pointers' could be
what is needed. But before going on, I want first to get more
confortable with programming with trees. It's all very well to say
they're easy to
be in Haskell, or if it's necessary at all.
Many thanks for your help,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
HackageDB as well as add new versions. It would also be helpful to
see download statistics. If something is much in demand, this would
probably be an incentive to update it more often..
Regards,
Hans van Thiel
Cheers,
Daniel
Am Mittwoch, 20. Juni 2007 20:32 schrieb ich:
Hi again,
I thought
, looks very nice.
Regards,
Hans van Thiel
In fact part of the project seems to be to
allow the development of eclipse plugins written in haskell, which
could allow the possibility of integrating some of the tools listed on
the haskell wiki with it.
I also tried eclipsedarcs [3] for darcs
like that as
the working title; what is the 'real world' anyway?
But I'll be looking forward to the book, whatever its name!
Regards,
Hans van Thiel
If you'd like to be a reviewer, please
drop us a line at [EMAIL PROTECTED], and let us
know a little about your background and areas of interest
such dependencies.
Regards,
Hans van Thiel
* Hans van Thiel [EMAIL PROTECTED] [070521 05:45]:
Hello All,
Version 0.2 of Emping, a utility to derive heuristic rules from a table
of nominal data, is available. In addition to a reduced normal form
in .csv format, which can be read by Open
the HackageDB.
Thanks,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Thanks for the help! Strangely, I just now received your messages from
April 28, hence the late reply...
Hans van Thiel
On Sat, 2007-04-28 at 18:09 +0200, Henning Thielemann wrote:
On Sat, 28 Apr 2007, Hans van Thiel wrote:
Hello All,
The standard function groupBy of List.hs doesn't work
. (I'm using the ghc 6.6.1 Fedora Core 6 package).
Many thanks in advance!
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sat, 2007-05-19 at 15:30 +0100, David House wrote:
On 19/05/07, Hans van Thiel [EMAIL PROTECTED] wrote:
causes no problems in Hugs (-98 flag) but compiling with GHC produces:
There's the solution to your problem: type synonym instances aren't
Haskell98, so you have to pass the -98 flag
) = partition ((head ls) `eq`) ls
example
partitionBy (\x y - (last x) == (last y)) [abc,bd,bdc,abd]
result
[[abc,bdc],[bd,abd]]
Of course, any crits would be appreciated, but maybe this will save
somebody some time..
Thanks,
Hans van Thiel
___
Haskell-Cafe
Thanks,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sat, 2007-04-28 at 06:45 -0700, Stefan O'Rear wrote:
On Sat, Apr 28, 2007 at 03:49:44PM +0200, Hans van Thiel wrote:
Hello All,
The standard function groupBy of List.hs doesn't work as I expect in
this case:
groupBy (\x y - (last x) == (last y)) [abc, bd,cac]
results
On Sat, 2007-04-28 at 15:08 +0100, Neil Mitchell wrote:
Hi Hans,
The standard function groupBy of List.hs doesn't work as I expect in
this case:
groupBy (\x y - (last x) == (last y)) [abc, bd,cac]
You are doing something wrong. groupBy is specified to never reorder
elements.
[] = []
partitionBy eq ls =
(fst x):(partitionBy eq (snd x)) where
x = partition1 eq ls
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
) there is a very helpful and knowledgeable community.
A major disadvantage of Haskell is the lack of books, especially with
regard to intermediate level programming and the libraries.
Documentation that is available varies in quality and is, in general,
fragmented.
Best Regards,
Hans van Thiel
it at that, because (1) I'm assuming the package
itself is OK and (2) it's a standalone utility so maybe Cabal is
overkill anyway (though it's nice how Cabal forces a structure). Just
compiling the source modules is, probably, the preferred option here.
Thanks,
Hans van Thiel
On Tue, 2007-03-13 at 00:47 -0400, Albert Y. C. Lai wrote:
Hans van Thiel wrote:
sequence :: Monad m = [m a] - m [a]
You write:
The = used by sequence is the same = in the MyState monad,
since you instantiate m to MyState String. Therefore, sequence
performs all the state
Albert,
Thanks very much for your explanation. I see now that I confused the
state function with the f, but it's still not quite clear.
data MyState a b = MyStateC ([a] - ([a], b))
This defines an algebraic data type (...why is it called algebraic?)
with two type variables and a unary
for any pointers and clarification!
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
next in the class declaration) and get similar messages.
The definition of NumMon by itself, just the first line, is accepted by
Hugs and GHCi both.
What am I doing wrong? Many thanks in advance.
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe
On Sun, 2007-01-21 at 09:42 -0800, Stefan O'Rear wrote:
On Sun, Jan 21, 2007 at 06:21:34PM +0100, Hans van Thiel wrote:
class (Num a, Monoid a) = NumMon a where
e = 0
add x y = x + y
What am I doing wrong? Many thanks in advance.
Nothing!
What you are trying to do, declare
I. On Sun, 2007-01-21 at 11:20 -0800, Stefan O'Rear wrote:
On Sun, Jan 21, 2007 at 08:00:53PM +0100, Hans van Thiel wrote:
On Sun, 2007-01-21 at 09:42 -0800, Stefan O'Rear wrote:
This is the closest you'll get with GHC extensions:
{-# OPTIONS_GHC -fallow-undecidable-instances
On Mon, 2007-01-08 at 16:11 -0200, Alex Queiroz wrote:
Hallo,
On 1/8/07, Hans van Thiel [EMAIL PROTECTED] wrote:
Hello All,
The beta of the 'Gtk2Hs:Getting Started' short tutorial for beginners,
Haskell GUI for Dummies, if you like :-) can be viewed at
http://j-van-thiel.speedlinq.nl
and explains how to use it, refers to the Glade
tutorials, gives an example of widget layout, and ends with some general
pointers.
It should take no more than 2,3 hours of the user's time.
All feedback very welcome.
Regards,
Hans van Thiel
___
Haskell-Cafe
are interested could use these and check out the Haskell
Gtk2Hs listings later.
Thanks,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
doesn't.
Ah, so that's it! Thanks, all.
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Oct 24, 2006 at 06:14:14PM +0200, Hans van Thiel wrote:
I have a similar question. When I use getChar with Hugs the
newline
(caused by pressing 'Enter') seems to be carried over into
the next
call of main, where it is treated as a single input
. I suppose the solution offered here:
hSetBuffering stdin NoBuffering
will have the desired effect, but is there another way?
Thanks,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
No, it happens with Hugs on Fedora Core 5 (the fc5 Hugs package), not
WinHugs.
Thanks,
Hans
On Tue, 2006-10-24 at 17:27 +0100, Neil Mitchell wrote:
Hi
I have a similar question. When I use getChar with Hugs the newline
(caused by pressing 'Enter') seems to be carried over into the next
to submit my
separate concept (attached) for comments.
Thanks,
Hans van Thiel
Gtk2HsGlade.odt
Description: application/vnd.oasis.opendocument.text
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
Regards,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
From:
Hans van Thiel
[EMAIL PROTECTED]
Reply-To:
[EMAIL PROTECTED]
To:
Johan Tibell
[EMAIL PROTECTED]
Subject:
Re: [Haskell-cafe] Re: Why Haskell
Haskell made it into the business world (yet), after being
available for 15 years, or is this the wrong question?
Many thanks for your comments,
Hans van Thiel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
74 matches
Mail list logo
