Hi Christos,
We and a colleague from Japan use Haskell for Inductive Functional
Programming, i.e. learn programs from examples.
However, we just have started to port our program to Haskell:
http://www.cogsys.wiai.uni-bamberg.de/effalip/
Susumu Katayama has already a Haskell library:
Andrew Coppin wrote:
apfelmus wrote:
... and a solution to a problem that you souldn't have in the first
place. I mean, if you want to construct XML or SQL statements, you ought
to use an abstract data type that ensures proper nesting etc. and not a
simple string.
Right. And if you
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sun, 12 Oct 2008 20:01:32 -0400
Gwern Branwen [EMAIL PROTECTED] wrote:
'K. So SourceGraph doesn't do any error reporting? I'll keep that in mind.
In this case, it isn't SourceGraph's fault: Haskell-Src-Exts can't parse it.
Maybe it doesn't parse
On Mon, Oct 13, 2008 at 2:04 AM, J. Garrett Morris
[EMAIL PROTECTED] wrote:
Indeed - MTL seems to have been rewritten at some point in the past to
prefer exhaustive enumeration to overlap.
Indeed, and I actually think this is a weakness of the current
implementation. Anyone who comes up with a
On Mon, Oct 13, 2008 at 08:43:48AM +0200, apfelmus wrote:
Yes. Just an injection problem is an understatement. And its the
implementation of the abstract data type that determines how fast things
are. Who said that it may not simply be a newtyped String ?
I think the attraction to the
ryani.spam:
On Mon, Oct 13, 2008 at 2:04 AM, J. Garrett Morris
[EMAIL PROTECTED] wrote:
Indeed - MTL seems to have been rewritten at some point in the past to
prefer exhaustive enumeration to overlap.
Indeed, and I actually think this is a weakness of the current
implementation. Anyone
On Mon, Oct 13, 2008 at 12:29 AM, Ryan Ingram [EMAIL PROTECTED] wrote:
Of course, the point of this message isn't just to complain. The
overlap implementation was abhorrent and it *is* better now than it
was before.
I'm curious what you find abhorrent about the overlap implementation
that was
Hi all,
there were several discussions on this list about different
implementations of Haskell running on the iPhone and other mobile
platforms over the last three months or so. I would very much like to
see the current state of what is and is not yet possible here reflected
in the Platforms
Step 1: Forget everything you know about OO classes, then try again :)
2008/10/13 Arun Suresh [EMAIL PROTECTED]:
class Foo a where
fooFunc :: a - Int
data FooData = FData
instance Foo FooData where
fooFunc _ = 10
So far so good.
class Bar a where
barFunc :: (Foo b) = a - b
Don Stewart wrote:
Note that these builds are with soft deps, provided on hackage,
base 4
parsec 3
HaXml == 1.13.*
QuickCheck 2
which train cabal-install to build a larger set of packages.
Will this happen automatically somehow, or will users have to do this manually?
Hello Arun,
Monday, October 13, 2008, 2:50:27 PM, you wrote:
I agree that this does look more succinct... but what if I write some generic
code for the
in the render method of the Drawable class and package it into a library..
i recommend you to read
As part of a project to formalize the theory of overlapping instances,
I'm looking for examples of overlapping and incoherent instances and
their usage.
EMGM [1] uses overlapping instances to make it more convenient to use
extensible, generic functions on arbitrary datatypes. They're not
Normally I agree with you, apfelmus, but here at least I have to differ!
On Mon, Oct 13, 2008 at 11:50 AM, apfelmus [EMAIL PROTECTED] wrote:
*HTML toString $ tag b [] [tag i [] [text ], text test]
bilt;gt;/itest/b
I'd say the big problem is that your embedded language for describing
HTML is
On Mon, Oct 13, 2008 at 11:18 AM, Arun Suresh [EMAIL PROTECTED] wrote:
] you seem to have read my mind [:)].. i actaually hit upon this issue while
] trying to transcode some C++ to Haskell..
(literate haskell post, save it into draw.lhs and you can load it in ghci!)
What you usually want when
On 13 Οκτ 2008, at 9:41 ΠΜ, Martin Hofmann wrote:
Hi Christos,
We and a colleague from Japan use Haskell for Inductive Functional
Programming, i.e. learn programs from examples.
However, we just have started to port our program to Haskell:
http://www.cogsys.wiai.uni-bamberg.de/effalip/
Devin Mullins wrote:
apfelmus wrote:
Yes. Just an injection problem is an understatement. And its the
implementation of the abstract data type that determines how fast things
are. Who said that it may not simply be a newtyped String ?
I think the attraction to the SafeString example is that
On Sun, 2008-10-12 at 14:46 -0700, Don Stewart wrote:
Hey all.
The GHC 6.10 RCs are out, and we're preparing the release. To help manage the
transistion to GHC 6.10 it is now possible to actually build all the 3rd party
Haskell packages, and publish their results wrt. the release
*HTML toString $ tag b [] [tag i [] [text ], text test]
bilt;gt;/itest/b
I'd say the big problem is that your embedded language for describing
HTML is way more complex for a domain expert than
doc = renderHTML $(q bi#{v1}/i#{v2}/b)
where
v1 =
v2 = test
How
Hello folks,
Im kinda new to haskell. Ive only been fiddling around with it for bout 3 -
4 weeks now.
And for the life of me... i cant seem to figure out why this doesnt work :
class Foo a where
fooFunc :: a - Int
data FooData = FData
instance Foo FooData where
fooFunc _ = 10
class
On Mon, Oct 13, 2008 at 4:08 PM, Ryan Ingram [EMAIL PROTECTED] wrote:
On Mon, Oct 13, 2008 at 11:18 AM, Arun Suresh [EMAIL PROTECTED]
wrote:
] you seem to have read my mind [:)].. i actaually hit upon this issue
while
] trying to transcode some C++ to Haskell..
(literate haskell post, save
Hallo,
On Fri, Oct 10, 2008 at 5:48 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Don Stewart wrote:
This could be a game changer.
In what way? As far as I'm aware, .NET never really caught on and has long
since become obsolete. Or do you just mean the type system machinery that
has been
{-# OPTIONS_GHC -fglasgow-exts #-}
module Test where
import qualified Data.Set as S
Hi. I try to model the following: Hypotheses are build up from Rules,
which itself are made of the type Rule. Because I may change the
implementation later, I want to use type classes, which define the
Ivan:
In this case, it isn't SourceGraph's fault: Haskell-Src-Exts can't parse it.
Maybe it doesn't parse CPP stuff properly? I'm not sure how I can get
SourceGraph to parse files only after they've been pre-processed...
haskell-src-exts doesn't include a CPP processor no, but will discard
Hello,
Sadly, I've found --mk-dll option unrecognized by latest stable GHC 6.8.3..
I'm new to win32 development
How one can make win32 dll at the moment?
I've successfully compiled Adder sources from example from section
11.5.4 of user guide
I need to build dll to be called from foreign
Ivan Lazar Miljenovic [EMAIL PROTECTED] wrote:
In this case, it isn't SourceGraph's fault: Haskell-Src-Exts can't
parse it. Maybe it doesn't parse CPP stuff properly? I'm not sure how
I can get SourceGraph to parse files only after they've been
pre-processed...
You could try using the
Hello Ryan..
On Mon, Oct 13, 2008 at 3:33 PM, Ryan Ingram [EMAIL PROTECTED] wrote:
Step 1: Forget everything you know about OO classes, then try again :)
you seem to have read my mind [:)].. i actaually hit upon this issue while
trying to transcode some C++ to Haskell..
2008/10/13 Arun
_Some_ newcommers flounder because they expect Haskell to be just
another VB / C++ / Java / whatever. (Do we really want to encourage
these people to be learning Haskell in the first place?) (...)
I hope so. One of my most important motivations to try
Haskell was that I thought it was
First, a comment. I don't understand why you have so many classes!
What proof invariants are they helping you enforce? Do you really a
constraint that says that something is a Rule? Are you going to
write functions that are polymorphic over CRule? How can you do so
when CRule has no methods?
On Mon, Oct 13, 2008 at 6:02 PM, Mauricio [EMAIL PROTECTED] wrote:
On Fri, Oct 10, 2008 at 10:49 PM, Andrew Coppin [EMAIL PROTECTED] wrote:
_Some_ newcommers flounder because they expect Haskell to be just another
VB / C++ / Java / whatever. (Do we really want to encourage these people to
be
Arun Suresh wrote:
Hello folks,
Im kinda new to haskell. Ive only been fiddling around with it for
bout 3 - 4 weeks now.
And for the life of me... i cant seem to figure out why this doesnt work :
class Foo a where
fooFunc :: a - Int
data FooData = FData
instance Foo FooData where
Ryan Ingram wrote:
I would go further than that. To Andrew's question, I say:
Yes, we want to encourage these people to learn Haskell. We want to
smash all their expectations into tiny little pieces. We want their
brains to explode. And after that, we want to take what is left, pick
it up
On Mon, 2008-10-13 at 18:28 +0100, Andrew Coppin wrote:
Reid Barton wrote:
It's not difficult: the operation is called
mplus :: MyMonad a - MyMonad a - MyMonad a
and already exists (assuming the author of ListT has not forgotten to
write a MonadPlus instance).
I see... I was
On Mon, 2008-10-13 at 18:38 +0100, Andrew Coppin wrote:
Ryan Ingram wrote:
I would go further than that. To Andrew's question, I say:
Yes, we want to encourage these people to learn Haskell. We want to
smash all their expectations into tiny little pieces. We want their
brains to
Hi Yakov,
On Mon, Oct 13, 2008 at 07:47:15PM +0400, Yakov ZAYTSEV wrote:
Sadly, I've found --mk-dll option unrecognized by latest stable GHC 6.8.3..
I'm new to win32 development
How one can make win32 dll at the moment?
I've successfully compiled Adder sources from example from section
Reid Barton wrote:
It's not difficult: the operation is called
mplus :: MyMonad a - MyMonad a - MyMonad a
and already exists (assuming the author of ListT has not forgotten to
write a MonadPlus instance).
I see... I was under the impression that mplus is just any arbitrary
binary
marlowsd:
Don Stewart wrote:
Note that these builds are with soft deps, provided on hackage,
base 4
parsec 3
HaXml == 1.13.*
QuickCheck 2
which train cabal-install to build a larger set of packages.
Will this happen automatically somehow, or will users have to do
Jonathan Cast wrote:
I see... I was under the impression that mplus is just any arbitrary
binary operation over a given monad. How do you know what it does for a
specific monad?
Process of elimination. Sometimes, this doesn't narrow things down to a
single operation, but it gives you a
On Mon, 2008-10-13 at 18:58 +0100, Andrew Coppin wrote:
Jonathan Cast wrote:
I see... I was under the impression that mplus is just any arbitrary
binary operation over a given monad. How do you know what it does for a
specific monad?
Process of elimination. Sometimes, this
The new QuasiQuotes extension arriving with ghc 6.10 is very exciting,
and handling multi-line string literals is like stealing candy from
a baby. ;)
-
-- Here.hs
module Here (here) where
import Language.Haskell.TH.Quote
On Mon, 13 Oct 2008, Andrew Coppin wrote:
Reid Barton wrote:
It's not difficult: the operation is called
mplus :: MyMonad a - MyMonad a - MyMonad a
and already exists (assuming the author of ListT has not forgotten to
write a MonadPlus instance).
I see... I was under the impression that
Hi Andrew,
On Mon, Oct 13, 2008 at 19:58, Andrew Coppin
[EMAIL PROTECTED] wrote:
Right. OK. So... isn't there a class somewhere called MonadChoice or
similar, which defines (|)?
Just to pitch in a helpful tip, Hoogle is excellent for these kind of
questions (which come up very often):
On Mon, 2008-10-13 at 10:54 -0700, Don Stewart wrote:
marlowsd:
Don Stewart wrote:
Note that these builds are with soft deps, provided on hackage,
base 4
parsec 3
HaXml == 1.13.*
QuickCheck 2
which train cabal-install to build a larger set of packages.
On Mon, 2008-10-13 at 16:15 +0200, Hans van Thiel wrote:
What's the status of Gtk2Hs with regard to Cabal? Is it correct that not
one of the applications on Hackage, and there are some, uses or can use
a GUI at this point in time?
Gtk2Hs still does not use Cabal as its build system. With the
Alex Queiroz wrote:
On Fri, Oct 10, 2008 at 5:48 PM, Andrew Coppin
In what way? As far as I'm aware, .NET never really caught on and has long
since become obsolete.
In what alternate universe?
Anthropic Principle: Everyone is in a different bubble of observable
reality.
On Mon, Oct 13, 2008 at 1:35 PM, Albert Y. C. Lai [EMAIL PROTECTED] wrote:
Alex Queiroz wrote:
On Fri, Oct 10, 2008 at 5:48 PM, Andrew Coppin
In what way? As far as I'm aware, .NET never really caught on and has
long
since become obsolete.
In what alternate universe?
Anthropic
Matt Morrow wrote:
The new QuasiQuotes extension arriving with ghc 6.10 is very exciting,
and handling multi-line string literals is like stealing candy from
a baby. ;)
Cool. Is there any progress on getting GHC to *not* freak out when you
ask it to compile a CAF containing several hundred
{-# LANGUAGE FlexibleInstances #-}
module Overload where
class Silly s where
go :: s
instance Silly ([x] - [x]) where
go = reverse
instance Silly (Int - Int) where
go = (+1)
Don't even ask.
Suffice it to say, you *can* make Haskell support arbitrary overloading
of function names
Hello Ian,
Monday, October 13, 2008, 9:47:12 PM, you wrote:
http://www.haskell.org/ghc/docs/6.8.3/html/users_guide/win32-dlls.html
this page says Since this Haskell DLL depends on a couple of the DLLs
that come with GHC, make sure that they are in scope/visible.
i just checked 6.8.3
Hello Andrew,
Monday, October 13, 2008, 10:51:43 PM, you wrote:
Suffice it to say, you *can* make Haskell support arbitrary overloading
of function names like C++ has, _if_ you abuse the type system violently
enough. Please, won't somebody think of the children?!?
people that make critique
Sorry,
as Chris Eidhof replied to me CAL is not pure. I was only playing with
GemCutter, I don't use CAL so I didn't know.
Fero
On Sun, Oct 12, 2008 at 5:32 PM, frantisek kocun
[EMAIL PROTECTED]wrote:
There is CAL language (purely functional, very Haskell like, the most I
have seen). CAL
Thanks a lot Ian!
I was with abstracted eyes after day of work
Luckily after your hint I've finished my haskell MEX file experiment
in few minutes!
Thanks!
On Mon, Oct 13, 2008 at 9:47 PM, Ian Lynagh [EMAIL PROTECTED] wrote:
Hi Yakov,
On Mon, Oct 13, 2008 at 07:47:15PM +0400, Yakov ZAYTSEV
Hallo,
Andrew Coppin wrote:
In what alternate universe?
One with a 3-day time dilation, apparently...
[Sorry, couldn't resist. ;-) ]
No problem, I didn't get your point anyway.
-alex
http://www.ventonegro.org/
___
On Mon, 2008-10-13 at 19:51 +0100, Andrew Coppin wrote:
{-# LANGUAGE FlexibleInstances #-}
module Overload where
class Silly s where
go :: s
instance Silly ([x] - [x]) where
go = reverse
instance Silly (Int - Int) where
go = (+1)
Don't even ask.
Suffice it to
Bulat Ziganshin wrote:
people that make critique on haskell type classes, don't take into
account that it's unlike C++ templates, implemented via run-time
dictionaries and other modules may define new instances
Personally, I have no clue how C++ templates work [yet]. (As in, I'm
learning
Dino Morelli wrote:
I was wishing I could do this:
let foo = str `or-if-empty` default
If it was a Maybe, this works with mplus:
(Just foo) `mplus` (Just bar) == Just foo
Nothing `mplus` (Just bar) == Just bar
But not so much for list, mplus just ain't defined that way,
Jonathan Cast wrote:
Flexible instances are extroardinarily useful:
I'm sure the GHC team wouldn't have bothered otherwise. ;-)
AFAIK, flexible instances just means that absolutely anything can be a
class instance, right?
instance Monad m = MonadState s (StateT s m)
instance MonadState
Hans van Thiel wrote:
Secondly, has Gtk2Hs compatibility been tested with GHC 6.10? In the
past there have sometimes been problems with new GHC releases and
Gtk2Hs. These have always been addressed, but it usually took a few
months..
I just built Gtk2Hs with the 6.10-rc on Windows, and it
Hello Andrew,
Tuesday, October 14, 2008, 12:15:04 AM, you wrote:
people that make critique on haskell type classes, don't take into
account that it's unlike C++ templates, implemented via run-time
dictionaries and other modules may define new instances
Personally, I have no clue how C++
Question 1: Why are there lazy and strict modules of some monads? (e.g.
Control.monad.State)
Question 2: If I define a new monad (say xyz), does it have to be as
control.monad.xyz module?
daryoush
___
Haskell-Cafe mailing list
Bulat Ziganshin wrote:
Hello Andrew,
Tuesday, October 14, 2008, 12:15:04 AM, you wrote:
people that make critique on haskell type classes, don't take into
account that it's unlike C++ templates, implemented via run-time
dictionaries and other modules may define new instances
On Mon, 2008-10-13 at 13:37 -0700, Daryoush Mehrtash wrote:
Question 1: Why are there lazy and strict modules of some monads?
(e.g. Control.Monad.State)
Because both are useful, for different purposes. (For the same reason
that it's helpful, in general, to have both eager and lazy evaluation
The new QuasiQuotes extension arriving with ghc 6.10 is very exciting,
and handling multi-line string literals is like stealing candy from
a baby. ;)
(...)
Cool!!!
How exactly QuasiQuote behave, and what
is available to handle them? (Or: can I
find information already on the web?)
Sugestion:
Is there a write up on what makes an implementation lazy vs strict?
I like to better understand the trade off between the two and use cases
where one is better than the other.
I noticed that some functions in the lazy implementation uses ~ .For
example
evalStateT :: (Monad m) = StateT s m
If you want to make Haskell more widely used, do pick a name for
Haskell Prime that starts with an A. I first heard of Haskell when
exploring the list of computer languages that Gedit could highlight.
Just imagine going through all those A,B,C,D,E,F,G before I came to
Haskell.
That is a simple
If you want to make Haskell more widely used, do pick a name for
Haskell Prime that starts with an A. I first heard of Haskell when
exploring the list of computer languages that Gedit could highlight.
Just imagine going through all those A,B,C,D,E,F,G before I came to
Haskell.
Those programmers
On Mon, Oct 13, 2008 at 3:29 AM, Ryan Ingram [EMAIL PROTECTED] wrote:
On Mon, Oct 13, 2008 at 2:04 AM, J. Garrett Morris
[EMAIL PROTECTED] wrote:
Indeed - MTL seems to have been rewritten at some point in the past to
prefer exhaustive enumeration to overlap.
Indeed, and I actually think this
(First of all, sorry for the double reply...)
2008/10/13 Arun Suresh [EMAIL PROTECTED]:
Now my client want to write another subclass for Drawable...
He can do that in any other file... package.. whatever...
How would he do that in Haskell ???
considering he may not modify the source file in
Hello,
The currently released version of monadLib does not use overlapping
instances, indeed.
However, in the monadLib repo (http://github.com/yav/monadlib) there
is a file called MonadLib4.hs which contains a version of the
library that is implemented with overlapping instances, so you can
play
2008/10/13 Daryoush Mehrtash [EMAIL PROTECTED]:
Is there a write up on what makes an implementation lazy vs strict?
I would be interested in seeing this, too!
I like to better understand the trade off between the two and use cases
where one is better than the other.
I noticed that some
On Mon, Oct 13, 2008 at 1:31 PM, Bulat Ziganshin
[EMAIL PROTECTED]wrote:
Hello Andrew,
Tuesday, October 14, 2008, 12:15:04 AM, you wrote:
people that make critique on haskell type classes, don't take into
account that it's unlike C++ templates, implemented via run-time
dictionaries and
Hello,
On Mon, Oct 13, 2008 at 3:16 PM, Stephen Hicks [EMAIL PROTECTED] wrote:
2008/10/13 Daryoush Mehrtash [EMAIL PROTECTED]:
Is there a write up on what makes an implementation lazy vs strict?
I would be interested in seeing this, too!
Typically it has to do with the strictness of the bind
On Mon, Oct 13, 2008 at 1:29 AM, Ryan Ingram [EMAIL PROTECTED] wrote:
Of course, the point of this message isn't just to complain. The
overlap implementation was abhorrent and it *is* better now than it
was before. But perhaps there is an abstraction we are missing that
would allow for
Oh, that's so cool.
But, this feather is too difficult to be configured in UE32 -- my costom IDE.
Pity. Hopes I wouldn't forget it later.
--
L.Guo
2008-10-14
-
From: Matt Morrow
At:
Pray tell, what kind of feats are expected of such a champion?
No answer. I guess my failed attempt at chivalrous-sounding wit killed the
message. I'll rephrase:
Does the job consist of:
Maintaining an independent repository of Haskell packages configured and
compiled for the current
Andrew Coppin wrote:
Bulat Ziganshin wrote:
people that make critique on haskell type classes, don't take into
account that it's unlike C++ templates, implemented via run-time
dictionaries and other modules may define new instances
Personally, I have no clue how C++ templates work [yet]. (As
On Mon, Oct 13, 2008 at 8:32 PM, Tommy M. McGuire [EMAIL PROTECTED] wrote:
Java (and presumably C#) generics are very much like a weakened version
of normal parametric polymorphism.
I'm curious, in what way are they weakened?
thanks,
Jason
___
Hi,
I wanted to install it with cabal. Well
$ cabal install derive
Resolving dependencies...
cabal: Couldn't read cabal file ./derive/0.1.2/derive.cabal
As I traced a little, it seemed that line: 'build-depends: base ==
4.*, syb' was wrong.
___
Hi,
I wanted to install this package. Well,
Building hprotoc-0.3.1...
...
[3 of 7] Compiling Text.ProtocolBuffers.ProtoCompile.Parser ...
Text/ProtocolBuffers/ProtoCompile/Parser.hs:48:0:
Type synonym `GenParser' should have 2 arguments, but has been given 1
In the type synonym
Hey all.
The GHC 6.10 RCs are out, and we're preparing the release of GHC proper.
To help manage the transistion to GHC 6.10 it is now possible to
actually build all the 3rd party Haskell packages, and publish their
results wrt. the release candidate.
For the first time ever, we're able to have
On Tue, 2008-10-14 at 12:58 +0800, Magicloud wrote:
Hi,
I wanted to install it with cabal. Well
$ cabal install derive
Resolving dependencies...
cabal: Couldn't read cabal file ./derive/0.1.2/derive.cabal
As I traced a little, it seemed that line: 'build-depends: base ==
4.*, syb'
On Mon, 2008-10-13 at 22:08 -0700, Don Stewart wrote:
Using GHC 6.10 RC from today, Cabal 1.6 and cabal-install 1.16, of 682
libraries and apps tried in total,
Note that's cabal-install-0.6 :-)
1 UnpackFailed
I've diagnosed this one. It will be fixed in the next cabal-install
point
On Mon, 13 Oct 2008 23:32:30 -0400, Tommy M. McGuire [EMAIL PROTECTED] wrote:
Andrew Coppin wrote:
Bulat Ziganshin wrote:
people that make critique on haskell type classes, don't take into
account that it's unlike C++ templates, implemented via run-time
dictionaries and other modules may
Sigh again, something that always makes me think that cabal is unusable
$ cabal install cabal-install
Resolving dependencies...
'cabal-install-0.6.0' is cached.
Configuring cabal-install-0.6.0...
Preprocessing executables for cabal-install-0.6.0...
Building cabal-install-0.6.0...
[ 1 of 29]
magicloud.magiclouds:
Hi,
I wanted to install this package. Well,
Building hprotoc-0.3.1...
...
[3 of 7] Compiling Text.ProtocolBuffers.ProtoCompile.Parser ...
Text/ProtocolBuffers/ProtoCompile/Parser.hs:48:0:
Type synonym `GenParser' should have 2 arguments, but has been given 1
84 matches
Mail list logo
