When I try to install phooey I get conflict with old-time that I am not
sure how to resolve. Any ideas?
> cabal install phooey
Resolving dependencies...
cabal: dependencies conflict: ghc-6.10.1 requires old-time ==1.0.0.2 however
old-time-1.0.0.2 was excluded because ghc-6.10.1 requires old-tim
I was interested to see a Runge-Kutta package
posted to this list recently, particularly as
I have a fairly simple-minded non-adaptive RK
"generator": an AWK script that takes a table
and some optional stuff and spits out C. The
Haskell package is, of course, a lot prettier
than my AWK program, a
On 25 Apr 2009, at 8:59 pm, Miguel Mitrofanov wrote:
Something like
newtype MyCoolMonad = MyCoolMonad (FirstTransformer
(SecondTransformer (ThirdTransformer Whatever))) deriving (Functor,
Monad, FirstClass, SecondClass, ThirdClass, SomeOtherClass)
Nobody would be really interested in "de
Tom,
A huge thanks for sharing this.
/jve
On Sun, Apr 26, 2009 at 4:39 PM, Tom Hawkins wrote:
> Atom is a DSL in Haskell for designed hard realtime embedded programs.
> At Eaton, we are using it to control hydraulic hybrid refuse trucks
> and shuttle buses. After my talk at CUFP
> (http://cu
How do I define type Random [Int] for rollNDice in Exercise 1, given the code
below?
Michael
Exercises
1. Implement rollNDice :: Int -> Random [Int] from the previous subsection
with >>= and return.
NOTE: Since >>= and return are already present in the Prelude, you may want t
2009/04/26 Miguel :
> 2009/04/26 Jason Dusek :
>> If we do not preserve the old ways, it'll be anarchy all the
>> way down.
>
> How exactly are you going to preserve old ways?
Whenever are we are presented with the a question of correct
conduct, we must re-affirm our commitment to the practice
Am Sonntag 26 April 2009 23:08:41 schrieb Jason Dusek:
> 2009/04/26 Daniel Fischer :
> > While I can easily imagine the need for 100-character lines to
> > improve readability, 200 is way beyond my imagination :)
>
> It's not beyond someone's imagination, though. Would you like
> that line to l
On Sun, 2009-04-26 at 19:03 +0200, Sven Panne wrote:
> The build process in itself is purely Cabal-based, it is only the
> configuration above which done via autoconf. So in theory you could write the
> few output files of the configure run by hand and then use Cabal, without any
> MinGW/MSYS o
2009/04/26 Daniel Fischer :
> While I can easily imagine the need for 100-character lines to
> improve readability, 200 is way beyond my imagination :)
It's not beyond someone's imagination, though. Would you like
that line to land on your screen?
If we do not preserve the old ways, it'll b
Well, 2 things: first, I meant "currying". second, I found the answer: no.
Under dynamic typing, the reduction steps are:
(\a -> \b -> a) 1 2
(\b -> a) 2 -- the substitution don't occur right away (that would be
lexical scope)
a
?? "a" is not in the environment!!
Sorry for the noise.
PS: In a me
Atom is a DSL in Haskell for designed hard realtime embedded programs.
At Eaton, we are using it to control hydraulic hybrid refuse trucks
and shuttle buses. After my talk at CUFP
(http://cufp.galois.com/2008/schedule.html), a few people inquired
about atom -- I finally had a chance to upload it
I've installed recently hsdc-sqlit3 on my Windows. I remember it was enough to
copy dll to system32, header .h to somewhere and key in path to both to cabal
file. Then usual stuff with setup. It worked and I managed to access DB.
best,
Bartek
On Thursday 23 April 2009 03:13:38 Michael P Mossey
> There's a tool for converting SML to JavaScript:
Such tools converting between different languages, are usually called
"compilers", by the way.
Stefan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/lis
Hi,
various people have over the years suggested and tried using
WiX from Haskell, so I'll leave it to them to comment & possibly
compare the two. I'm sure it blows Bamse out of the water as far
as functionality goes.
--sigbjorn
On 4/26/2009 11:00, Justin Bailey wrote:
How does this compare to
2009/04/26 Dimitry Golubovsky :
> John wrote:
>> I can't speak for Jason, but for me, this is not very useful.
>> I don't want to write in a Haskell DSL, I want to write in
>> Haskell. And not the whole program, either, just the parts
>> that really lend themselves to functional programming
>> (par
2009/04/26 John A. De Goes :
> 2009/04/26 Jason Dusek:
>> This was what I was originally writing in about, yeah.
>> However, thinking it over I realize there are some serious
>> problems. We really do want to work with a restricted subset
>> of Haskell that is more amenable to translation -- one wi
John wrote:
> I can't speak for Jason, but for me, this is not very useful. I don't
> want to write in a Haskell DSL, I want to write in Haskell. And not
> the whole program, either, just the parts that really lend themselves
> to functional programming (parsers, numeric computations, code
> gener
How does this compare to WiX? I haven't looked at the docs yet ...
On Sat, Apr 25, 2009 at 4:59 PM, Sigbjorn Finne
wrote:
> Hi,
>
> a new version of Bamse has been uploaded to hackage,
>
> http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bamse
>
> Bamse is a package and application for
Am Donnerstag, 9. April 2009 00:28:35 schrieb Peter Verswyvelen:
> Yes I totally agree that it is overkill. Ideally I would like every package
> to install on Windows without requiring MinGW. But I was just explaining
> the situation as it is right now.
Well, I don't like using autoconf, either, b
dominic:
> Malcolm Wallace cs.york.ac.uk> writes:
>
> >
> > Dominic Steinitz blueyonder.co.uk> wrote:
> >
> > > I want to use hpc to check that the ASN.1 library tests cover all the
> > > code. When I run it with a set of tests that I *know* don't test
> > > certain things, it reports that t
On Apr 26, 2009, at 10:18 AM, Jason Dusek wrote:
This was what I was originally writing in about, yeah.
However, thinking it over I realize there are some serious
problems. We really do want to work with a restricted subset
of Haskell that is more amenable to translation -- one with
finite
2009/04/26 John A. De Goes :
> I can't speak for Jason, but for me, this is not very useful.
> I don't want to write in a Haskell DSL, I want to write in
> Haskell. And not the whole program, either, just the parts
> that really lend themselves to functional programming
> (parsers, numeric computat
I can't speak for Jason, but for me, this is not very useful. I don't
want to write in a Haskell DSL, I want to write in Haskell. And not
the whole program, either, just the parts that really lend themselves
to functional programming (parsers, numeric computations, code
generators, variou
Hi, can this code
(\a -> \b -> a) 1 2
eval to normal form in a strict language with dynamic scope?
Thanks,
Loup
PS: some context:
I am currently implementing a toy language. The AST is this one:
data whnf = -- Weak Head Normal Form
| Unit
| Int of int
| Bool of bool
| Prim of (whnf
On Sun, Apr 26, 2009 at 03:23:17PM +0200, Thomas van Noort wrote:
> This is a recurring problem[1] and I'm still looking for a really
> satisfying solution. The only working and non-verbose solution I found is
> the one Miguel suggests. Although I'm not too fond of splitting up the
> monadic fun
Henning Thielemann schrieb:
>
> On Mon, 6 Apr 2009, Kalman Noel wrote:
>
>> I'm not complaining, and I'm not sure what I mean :) I may like a scheme
>> where functions operating on a type or type class live in a module
>> seperate from the type (class) definition, so you could import a
>> specifi
2009/4/25 Thomas Hartman
> In the program below, can someone explain the following debugger output to
> me?
>
> After :continue, shouldn't I hit the f breakpoint two more times?
> Why do I only hit the f breakpoint once?
> Is this a problem in the debugger?
>
> thart...@ubuntu:~/haskell-learni
Jason and everybody interested,
Please check out a package I recently (just by coincidence: I haven't
seen this topic on the list until after I uploaded it) uploaded to
Hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/jsmw-0.1
This is a basic monadic interface to Javascript co
This is a recurring problem[1] and I'm still looking for a really
satisfying solution. The only working and non-verbose solution I found
is the one Miguel suggests. Although I'm not too fond of splitting up
the monadic functions into separate type classes. A similar solution is
described elsewh
Am Sonntag 26 April 2009 04:38:42 schrieb Jason Dusek:
> > As always, opinions on aesthetics differ slightly, but
> > overall, everyone seems to mostly agree...
>
> Eh? Since when did they mostly agree? The 200 column example
> we've seen brought out a lot of disagreement.
Well, to be picky, B
{-# LANGUAGE MultiParamTypeClasses #-}
class Returnable m a where ret :: a -> m a
class Bindable m a b where bind :: m a -> (a -> m b) -> m b
newtype MOAMonad r m a = MOAMonad ((a -> m r) -> m r)
instance Monad (MOAMonad r m) where
return x = MOAMonad $ ($ x)
MOAMonad h >>= f = MOAMonad $
Hi,
I have a Haskell problem that keeps cropping up and I wondered if there
was any solution/work-around/dirty-hack that could help. I keep wanting
to define class instances for things like Functor or Monad, but with
restrictions on the inner type. I'll explain with an example, because I
fi
32 matches
Mail list logo
