Hi,
Testing of pure code ... . way cool ... I am sure there literature
from the first order logic, model theory, categorical logic viewpoint??
Kind regards, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Have you thought about doing this for Ubuntu? If you know how to
automatically generate packages, you could set up a PPA (private package
archive) on Launchpad.
I've spoken with Jeremy Shaw, who has similar systems in place, based
also on Cabal (and cabal-install), for generating native
Jason Dagit wrote:
Thank you for releasing this!
No worries. I might never have got around to releasing it if it wasn't
for the encouragement of Manuel Chakravarty, Don Stewart, and others.
Thanks guys!
[...] as I understand it the Haskell you write still lives in
Haskell-land and the .NET
Justin Bailey wrote:
Thanks to everyone for their feedback. I've made some updates and
posted the PDF to my blog:
http://blog.codeslower.com/2008/10/The-Haskell-Cheatsheet
I was wondering why there isn't a PDF directly downloadable anywhere... ;-)
FWIW, I just learned something by
There doesn't seem to be any option to make Pandoc produce actual MathML
output. Is there a reason for this?
(The only option I can see is to spit out raw LaTeX plus a 70KB
JavaScript program to transform this into MathML at the client end ---
which seems a little silly to me. There's also no
On Sat, Oct 11, 2008 at 8:32 PM, Simon Richard Clarkstone
[EMAIL PROTECTED] wrote:
(Darnit Thunderbird, why don't you DWIM when I hit reply or reply-all?)
You're not writing about Perl, you're writing about Haskell! It
should have been a type error.
Luke
Hi Jason,
So in an automatic translation I would replace partial application
with lambdas. This shouldn't be a problem right?
suppose f is a 3-argument function, and you encounter the application
f x. One possible translation would be to replace f x with
(\y. \z. f (x,y,z))
I don't know
On Saturday 11 October 2008 17:45:39 John A. De Goes wrote:
I have strong interest in hosting GHC on the JVM. And I suspect it
would be good for the Haskell community, as the JVM already runs on
nearly every machine known to man, has a wealth of cross-platform
libraries, and is getting
On Oct 12, 2008, at 6:19 AM, Jon Harrop wrote:
On Saturday 11 October 2008 17:45:39 John A. De Goes wrote:
I have strong interest in hosting GHC on the JVM. And I suspect it
would be good for the Haskell community, as the JVM already runs on
nearly every machine known to man, has a wealth of
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I'd like to announce version 0.4 of my Graphalyze library [1] and 0.2 of my
SourceGraph programme [2].
[1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Graphalyze
[2]
On Sun, Oct 12, 2008 at 6:21 AM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Also, while Markdown *almost* does what I want, there are a few small
constructs it doesn't have. For example, I'd like to have some way to denote
a term the first time I use it. I could just use italics, but I'd prefer
There is CAL language (purely functional, very Haskell like, the most I have
seen). CAL Eclipse plugin (IDE for CAL for non java-ers) is incredible, with
support for code comletition, documentation, refactor, code navigation..
They have graphical editor GemCutter for it as well. You can use java
Surely I've overseen a small point. But I can't see it:
Why doesn't ghc recognize taht elc_ (class decl), elc (instance decl) and elc_1
are the same type
To help you find the connecting pieces faster I've marked them with ## ##
Marc
data PT a b = PT b -- phantom type containing state a and the
David Menendez wrote:
Markdown allows arbitrary HTML tags, so you can just put the terms in
a dfn element.
I don't know if that will work with the LaTeX conversion. Markdown is
specifically designed to produce HTML, so it's not clear to me how
Pandoc does any of the non-HTML output formats.
Am Sonntag, 12. Oktober 2008 17:38 schrieb Marc Weber:
Surely I've overseen a small point. But I can't see it:
Why doesn't ghc recognize taht elc_ (class decl), elc (instance decl) and
elc_1 are the same type To help you find the connecting pieces faster I've
marked them with ## ##
Marc
I am becoming extremely frustrated now. The task I want to perform is
simple, yet I simply cannot make Haskell do what I want.
I've given up hope of ever getting my program to handle infinite result
sets. That means I can make do with just ListT. So I have the following
monad:
type MyMonad
On Sun, 2008-10-12 at 18:08 +0100, Andrew Coppin wrote:
I am becoming extremely frustrated now. The task I want to perform is
simple, yet I simply cannot make Haskell do what I want.
I've given up hope of ever getting my program to handle infinite result
sets. That means I can make do with
On 12 Oct 2008, at 21:08, Andrew Coppin wrote:
I found that by using the brief and easily memorable construction
runIdentity $ runListT $ runStateT foo state I can get at the
result set for each action, and combine them. But nothing in hell
seems to transform this from [((), MyState)]
On Sun, Oct 12, 2008 at 1:08 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
I am becoming extremely frustrated now. The task I want to perform is
simple, yet I simply cannot make Haskell do what I want.
I've given up hope of ever getting my program to handle infinite result sets.
Did you miss
On 12 Oct 2008, at 9:28 pm, Henning Thielemann wrote:
On Thu, 9 Oct 2008, Iain Barnett wrote:
If I were to create an object in C#, for instance, I could add
code to the constructor that might limit the type further e.g.
public class Car
{
string model;
int wheels;
David Menendez wrote:
On Sun, Oct 12, 2008 at 1:08 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
I am becoming extremely frustrated now. The task I want to perform is
simple, yet I simply cannot make Haskell do what I want.
I've given up hope of ever getting my program to handle infinite result
J. Garrett Morris wrote:
Hello everyone,
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. One such example would be the old version of the Monad
Transformer Library, which used overlapping
MonadTrans. Any other examples or suggestions would be greatly
appreciated!
All the OOHAskell stuff?
Marc
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
jgmorris:
Hello everyone,
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. One such example would be the old version of the Monad
Transformer Library, which used overlapping instances
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 candidate.
For the first time ever, we're able to have all the 3rd
Don Stewart wrote:
A quick, ad hoc search reveals, for the OverlappingInstances flag,
(some of these may only mention it in docs or in test suites),
[...]
logfloat-0.9.1
Ah yes, logfloat is using them too, for some of the auxiliary stuff.
* PartialOrd was designed to fix certain
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sun, 12 Oct 2008 13:24:40 -0400
Gwern Branwen [EMAIL PROTECTED] wrote:
However, I happened to want to look at the output for one of my modules,
XMonad.Util.XSelection - and it simply isn't there. Most of the XMC modules
seem to be there, but
On 2008.10.13 09:01:42 +1000, Ivan Lazar Miljenovic [EMAIL PROTECTED]
scribbled 1.3K characters:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sun, 12 Oct 2008 13:24:40 -0400
Gwern Branwen [EMAIL PROTECTED] wrote:
However, I happened to want to look at the output for one of my
Hi,
I'm trying to build 6.8.3 on Linux PowerPC, based on an old binary of
6.4 (latest build for this arch that I found). stage1 seems to have
built, but from there, building libraries almost immediately fails:
make -C libraries all
make[1]: Entering directory
On Sun, Oct 12, 2008 at 2:12 PM, Don Stewart [EMAIL PROTECTED] wrote:
Though I note mtl doesn't actually list OverlappingInstances in its
.cabal file,
Indeed - MTL seems to have been rewritten at some point in the past to
prefer exhaustive enumeration to overlap.
Thank you for the other
On Fri, 2008-10-10 at 18:13 -0500, John Goerzen wrote:
On Fri, Oct 10, 2008 at 02:29:54PM -0700, Jonathan Cast wrote:
I've
got a Haskell book here (Hutton, 170 pages) that doesn't even mention
how to open a file!
That short, and you expect minor features like that (that not
On Sun, Oct 12, 2008 at 06:39:58PM -0700, Jonathan Cast wrote:
On Fri, 2008-10-10 at 18:13 -0500, John Goerzen wrote:
On Fri, Oct 10, 2008 at 02:29:54PM -0700, Jonathan Cast wrote:
I've
got a Haskell book here (Hutton, 170 pages) that doesn't even mention
how to open a file!
On Sun, 2008-10-12 at 21:34 -0500, John Goerzen wrote:
On Sun, Oct 12, 2008 at 06:39:58PM -0700, Jonathan Cast wrote:
On Fri, 2008-10-10 at 18:13 -0500, John Goerzen wrote:
On Fri, Oct 10, 2008 at 02:29:54PM -0700, Jonathan Cast wrote:
I've
got a Haskell book here (Hutton, 170
hello,
Several months ago I saw on the wiki or maybe it was a discussion on
mechanism to get the ghc compiler's state. I can't remember enough to
ask even well. I know there is a wiki entry. Sorry ... I can only hint at
this ... ??
Thanks, Vasili
On Sun, Oct 12, 2008 at 06:03:30PM -0700, Devin Mullins wrote:
I'm trying to build 6.8.3 on Linux PowerPC, based on an old binary of
6.4 (latest build for this arch that I found). stage1 seems to have
built, but from there, building libraries almost immediately fails:
Configuring
Hi Vasili,
Perhaps you are looking for GHC as a library:
http://www.haskell.org/haskellwiki/GHC/As_a_library
Cheers,
Bernie.
On 13/10/2008, at 2:26 PM, Galchin, Vasili wrote:
hello,
Several months ago I saw on the wiki or maybe it was a discussion
on mechanism to get the ghc
Hi Bernie,
yep ... thanks!
Regards, Vasili
On Sun, Oct 12, 2008 at 11:30 PM, Bernie Pope [EMAIL PROTECTED]wrote:
Hi Vasili,
Perhaps you are looking for GHC as a library:
http://www.haskell.org/haskellwiki/GHC/As_a_library
Cheers,
Bernie.
On 13/10/2008, at 2:26 PM, Galchin,
37 matches
Mail list logo
