Hello,
I'm beginning to think what I'm after is not possible...
I figure I should try to explain exactly what it is I'm after...
Basically I'm trying to mix type hackery with HOAS. More specifically,
here is a data type which I would like to use:
data Exp a where
Lam :: (Exp a -> E
I've now almost got a FD solution to this problem, except that it won't
work, and I don't know why. Of course, it's possible that the AT solution
won't work either (I'm still compiling ghc, should have it in the
morning...), but at least it seems far simpler. My FD solution is below.
My trouble i
Hello,
Thanks for the response.
> Is it possible to write a class which checks to see if two given type
> arguments are unifiable?
>
This will probably help:
http://www.haskell.org/pipermail/haskell-cafe/2006-November/019705.html
That was Oleg's response to a post of mine:
http://www.hask
Anyway, how to set the options using cabal ?
the preprocessor is there so there must be a working way without my
modifications I don't know about.
> And Greencard.hs isn't just empty?
No, Greencard.*gc* looks like:
module Main where
import Test.QuickCh
G'day all.
Quoting Neil Mitchell <[EMAIL PROTECTED]>:
> I believe that compilers can get a lot cleverer - my hope is that one
> day the natural Haskell definition will outperform a C definition.
First off, let's get something straight: Everyone's metric for "performance"
is different. When some
> Quoting Bulat Ziganshin <[EMAIL PROTECTED]>:
> > Haskell can't provide fast execution speed unless very low-level
> > programming style is used (which is much harder to do in Haskell than in C,
> > see one of my last messages for example) AND jhc compiler is used
I have to dispute this Bulat's c
[Sorry for the duplicate Jeff.]
Is it possible to write a class which checks to see if two given type
arguments are unifiable?
This will probably help:
http://www.haskell.org/pipermail/haskell-cafe/2006-November/019705.html
That was Oleg's response to a post of mine:
http://www.haskell.org
On 12/17/06, Marc Weber <[EMAIL PROTECTED]> wrote:
> suggests that it wants "--libdir=../c_lib"
> instead of "--libdir ../c_lib". Could this be the case? I'd like to
> think it would parse them pretty much the same way but you can never be
> sure...
Hi Dougal.
Thanks for your suggestion.
This mig
Here's a sketch of an idea as a solution to my dilemma, which unfortunately
requires associated types. Any suggestions how it might be translatable
into functional dependencies? (I should say, I've not got a HEAD ghc, and
am just going by memory on my indexed types syntax.)
class Witness w where
G'day all.
Quoting Bulat Ziganshin <[EMAIL PROTECTED]>:
> Haskell can't provide fast execution speed unless very low-level
> programming style is used (which is much harder to do in Haskell than in C,
> see one of my last messages for example) AND jhc compiler is used
I've written an implementat
On 12/17/06, David Roundy <[EMAIL PROTECTED]> wrote:
Hello fellow haskellers,
I am wondering if anyone has an idea whether I'd run into trouble if I
rebound >>= in order to provide a more restricted monad. My idea is to
define a class:
. . .
which seems rather heavy. Can anyone think of sy
Magnus Therning schrieb:
There is of course the possibility that Haskell would bring a whole slew
of yet-to-be-determined security issues. I doubt it will be worse than
C though.
Haskell might be prone to denial-of-service attacks. E.g. sending it
data that cause it to evaluate an infinite da
On Sun, Dec 17, 2006 at 15:43:27 +0300, Bulat Ziganshin wrote:
>Hello Magnus,
>
>Friday, December 15, 2006, 7:26:41 PM, you wrote:
>
>> When reading this[1] I couldn't help thinking that rewriting GPG is
>> an excellent opportunity for using Haskell to have an impact on the
>> world.
>
>Haskell can
Hello Mark,
Sunday, December 17, 2006, 9:13:08 PM, you wrote:
> Is that an intrinsic feature of the language, or could compilers'
> optimisation plausibly get clever enough to do well without lots of seq
> and explicit unboxings and suchlike?
of course it is not language feature - if you will co
Hello Dan,
Sunday, December 17, 2006, 5:46:57 PM, you wrote:
> sum <- newIORef 0
> why in the world would you write a summation function like that?
gui/db libs are imperative ones and using them you need to deal with a lot
of mutable values. this example shows that programming with mutable dat
On Sun, Dec 17, 2006 at 01:35:49PM -0500, Chung-chieh Shan wrote:
> David Roundy <[EMAIL PROTECTED]> wrote:
> > class WitnessMonad wm where
> >(>>=) :: wm w w' a -> (a -> wm w' w'' b) -> wm w w'' b
> >(>>) :: wm w w' a -> wm w' w'' b -> wm w w'' b
> >return :: a -> wm w w' a
> >fa
paul:
> Magnus Therning <[EMAIL PROTECTED]> wrote:
>
> >When reading this[1] I couldn't help thinking that rewriting GPG is an
> >excellent opportunity for using Haskell to have an impact on the world.
>
> The Fedora project is planning to rewrite the foundations of RPM. I've
> noticed that th
> suggests that it wants "--libdir=../c_lib"
> instead of "--libdir ../c_lib". Could this be the case? I'd like to
> think it would parse them pretty much the same way but you can never be
> sure...
Hi Dougal.
Thanks for your suggestion.
This might be the case. But is not here.
(I could have bet
Quoth Marc Weber, nevermore:
$ ls; ./setup -v build || echo -e "\n\n ===> build failed \n\n"; eval `./setup -v build 2>&1 |
grep /usr/local/bin/greencard` && echo -e "\n\n => this works why?" ; ls
1> Greencard.cabal Greencard.gc Greencard_stub_ffi.c
Greencard_stub_ffi.h dis
I want to have a look at fruit which is using GCJNI, greencard, ...
That's why I want to learn how to use greencard with cabal.
If this is only a RTFM problem, can you point me to the docs?
When using the cabal builtin preprocessor I get the error that
--libdir has to be specified.
So I tried ad
Hi,
Is that an intrinsic feature of the language, or could compilers'
optimisation plausibly get clever enough to do well without lots of seq
and explicit unboxings and suchlike?
I believe that compilers can get a lot cleverer - my hope is that one
day the natural Haskell definition will outpe
David Roundy <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in
gmane.comp.lang.haskell.cafe:
> class WitnessMonad wm where
>(>>=) :: wm w w' a -> (a -> wm w' w'' b) -> wm w w'' b
>(>>) :: wm w w' a -> wm w' w'' b -> wm w w'' b
>return :: a -> wm w w' a
>fail :: String
Bulat Ziganshin <[EMAIL PROTECTED]> writes:
(snip)
> Haskell can't provide fast execution speed unless very low-level
> programming style is used
(snip)
Is that an intrinsic feature of the language, or could compilers'
optimisation plausibly get clever enough to do well without lots of seq
and exp
Hello fellow haskellers,
I am wondering if anyone has an idea whether I'd run into trouble if I
rebound >>= in order to provide a more restricted monad. My idea is to
define a class:
class WitnessMonad wm where
(>>=) :: wm w w' a -> (a -> wm w' w'' b) -> wm w w'' b
(>>) :: wm w w' a -> w
Hello Magnus,
Friday, December 15, 2006, 7:26:41 PM, you wrote:
> When reading this[1] I couldn't help thinking that rewriting GPG is an
> excellent opportunity for using Haskell to have an impact on the world.
Haskell can't provide fast execution speed unless very low-level
programming style is
sum <- newIORef 0
i <- newIORef 1
let go = do i' <- readIORef i
when (i'
why in the world would you write a summation function like that?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/has
Hello Waldemar,
Sunday, December 17, 2006, 2:44:28 AM, you wrote:
> Maybe, but what is still unclear for me: Haskell is wrong for GUI/Database
> application because of lack of good libraries or because of it's way of
> programming???
primarily, first. to some degree, second too. Haskell doesn't
Magnus Therning <[EMAIL PROTECTED]> wrote:
When reading this[1] I couldn't help thinking that rewriting GPG is an
excellent opportunity for using Haskell to have an impact on the world.
The Fedora project is planning to rewrite the foundations of RPM. I've noticed
that the higher level RPM t
On 15 dec 2006, at 14.14, Neil Bartlett wrote:
...
The Haskell web server that Simon Peyton-Jones et al described in
their
paper would be a great example. But where's the download? How do I
get a
copy to play with? In the "real world", things don't stop with the
publication of a paper ;-)
.
Hello,
I posted this message to Haskell-Libraries but were advised to try
Haskell-Cafe...
I'm trying some stuffs with the Graphics.HGL library and have a question. I
wonder if someone could help me with it.
I'm trying to write some Win32 application using openWindowEx. I see it has
a parameter
On Sat, 2006-12-16 at 20:41 +, Neil Mitchell wrote:
> That said, if I was writing a GUI+database thing, which doesn't do a
> lot of substantial processing (more just Add/Edit/Delete buttons), I'd
> definately use C# over Haskell.
Oh great...
Duncan wrote: "That's certainly one of the use c
Hello,
The HList paper gives a type cast:
class TypeCast a b | a -> b, b->a where typeCast :: a -> b
class TypeCast' t a b | t a -> b, t b -> a where typeCast' :: t->a->b
class TypeCast'' t a b | t a -> b, t b -> a where typeCast'' :: t->a->b
instance TypeCast' () a b => T
32 matches
Mail list logo
