Dear,
Recently I was wrapping something in a typeclass (you may argue the
reason for the typeclass, I will admit that's no longer needed, yet the
compile error still begs questioning). Basically if you have only one
global instance of a typeclass (so there is no overlapping), GHC will
still
Hello Christophe,
Wednesday, June 7, 2006, 12:27:22 PM, you wrote:
global instance of a typeclass (so there is no overlapping), GHC will
still complain about overlapping. Is there any reason this is so or is
GHC compains here about undecidability, not overlapping :)
-- Illegal instance
Hello Bulat,You are indeed correct. However I fail to see how there is any undecideability. If instead one specified it as follows, it would be fine:class Locatable a b | a - b, b - a where
value :: a - b
wrap :: b - ainstance Locatatable (Located a) a where value (L a) = a wrap a = L aIt
Hello Christophe!
Wed, Jun 07, 2006 at 10:27:22AM +0200 you wrote:
The sample code is:
{-# OPTIONS_GHC -fglasgow-exts #-}
module Main where
data Located a = L a
class Locatable a where
value :: Located a - a
wrap :: a - Located a
instance Locatable a where
You probably mean
Hello Christophe!
Wed, Jun 07, 2006 at 12:39:30PM +0400 I wrote:
instance Locatable a where
You probably mean ``instance Locatable (Located a)'', don't you?
Ouch, scratch that...
--
DoubleF
No virus detected in this message. Ehrm, wait a minute...
/kernel: pid 56921 (antivirus), uid
Simon Peyton-Jones [EMAIL PROTECTED] writes:
You probably know this, but your kind of application is a big reason
that we now make GHC available as a library. (Just say 'import GHC'.)
You shouldn't need to parse Haskell yourself: just call GHC's parser.
You get back a syntax tree with
Hi Pete
As part of my learning experience, I think I want to see if I can
write a haskell pastebin that does proper syntax highlighting.
Someone in #haskell suggested that I use just a lexer because using a
parser is overkill. However, I can't make this assessment until I see
how to use the
Pete Kazmier [EMAIL PROTECTED] wrote:
As part of my learning experience, I think I want to see if I can
write a haskell pastebin that does proper syntax highlighting.
Someone in #haskell suggested that I use just a lexer because using a
parser is overkill. However, I can't make this
Pete Kazmier [EMAIL PROTECTED] writes:
As part of my learning experience, I think I want to see if I can
write a haskell pastebin that does proper syntax highlighting.
Someone in #haskell suggested that I use just a lexer because using a
parser is overkill. However, I can't make this
Hello.
How can one profile a program which uses gtk2hs?
I get this:
$ ghc --make MainGui.hs -prof
Chasing modules from: MainGui.hs
Could not find module `Graphics.UI.Gtk.Mogul':
use -v to see a list of the files searched for
(imported from ./TreeViewHelpers.hs)
I tried to specify gtk2hs
I am using it on http://pass.net which is live in production but not
yet high volume. I hope to have some other projects live soon, but
they are currently works in progress.
-Alex-
On Tue, 6 Jun 2006, Joel Reymont wrote:
Folks,
Is anyone using HAppS in production right now?
It
Alex,
On Jun 7, 2006, at 9:08 PM, S. Alexander Jacobson wrote:
I am using it on http://pass.net which is live in production but
not yet high volume. I hope to have some other projects live soon,
but they are currently works in progress.
What type of machine are you running this on?
On Wed, 7 Jun 2006, Joel Reymont wrote:
What type of machine are you running this on?
What type of memory usage are you seeing?
Under what kind of load?
How much memory per connection?
darcs get http://pass.net/s/repo; and you can experiment for
yourself. If you have SearchPath installed
On Wed, 2006-06-07 at 23:58 +, Dmitry V'yal wrote:
Hello.
How can one profile a program which uses gtk2hs?
I get this:
At the moment the Gtk2Hs build system does not support building a
profiling version. This should change when the move to using Cabal,
however that may be some time. So
Hello,
Inspired by this, I have added my Su Doku solver to
http://www.haskell.org/haskellwiki/Sudoku.
Regards
Thorkil Naur
On Wednesday 31 May 2006 18:32, Chris Kuklewicz wrote:
A while back there was a long thread about Sudoku solvers (some of which
ended
up on
Dear,
I am writing a compiler (as you may have gathered from some previous
messages). Anyways I am stuck with a small monadic issue. I mostly use
indirect composite as this gives me the most flexibility with regards
taking out parts of the AST, or decorating at whim. Basically the
question
Walter,
There is this tool that I am working on called EclipseFP. It is a
Haskell IDE based on the Eclipse platform. We are still in alpha
stage, but maybe you'd like to check it out (and help me squash some
bugs :-). We can reach us at
http://eclipsefp.sourceforge.net
Cheers,
Thiago Arrais
On Jun 7, 2006, at 10:20 PM, S. Alexander Jacobson wrote:
Does this make sense?
Makes sense but almost sounds too good. What package would you
recommend I use with HAppS to merge HTML templates with application
data?
Thanks, Joel
--
http://wagerlabs.com/
On Thu, 8 Jun 2006, Joel Reymont wrote:
On Jun 7, 2006, at 10:20 PM, S. Alexander Jacobson wrote:
Does this make sense?
Makes sense but almost sounds too good.
:-) To be clear, the separation via binary streams has not yet been
implemented. I plan to do so only if I need it. If you get
Christophe Poucet wrote:
What I would like to do is combine HasVars and Type (mostly because in my
framework the two concepts shouldn't be divided from a design perspective)
into one type class to clean it up a bit. However I fail to see how I would
implement toType and fromType for the given
Hello Greg,
The idea however is that MonoType is going to be used in a recursive
way. For instance:
newtype FMT = FMT MonoType FMT
instance FMT where...
And this definition will have to reside on recursive definitions. In the
style of how HasVars was instantiated:
instance HasVars a =
21 matches
Mail list logo
