Patrick,
I find Andrew Frank's work on axiomatic specifications of GIS systems
-- which the paper you cite is built on -- very confusing, or indeed,
confused. They have a bunch of example like
data Car = Car Color
class Car a where
carColor :: a - Color
instance Car Car where
carColor
On Mon, 2011-01-31 at 01:13 -0500, Ryan Newton wrote:
Ok, I've made some progress in the direction Duncan suggested.
I can filter out the extra library before the postConf hook gets it.
And calling make from the hooks is pretty easy.
I've got a hack working that does allow full
Jan,
great, great work.
Although I'm quite new to the Haskell (but experienced in a dozen of
imperative languages and GP), I had no difficulties with adopting your
example to my initial needs.
Now I'm facing new problem: is it possible to create recursive program
structures with your library
Michael Snoyman mich...@snoyman.com wrote:
On Mon, Jan 31, 2011 at 1:09 PM, Ertugrul Soeylemez e...@ertes.de wrote:
Hello everybody,
how well do WAI, Yesod and the 'persistent' package play with
concurrency? For example, I'd like to write a program, which
concurrently provides two
On Mon, Jan 31, 2011 at 2:28 PM, Ertugrul Soeylemez e...@ertes.de wrote:
Michael Snoyman mich...@snoyman.com wrote:
On Mon, Jan 31, 2011 at 1:09 PM, Ertugrul Soeylemez e...@ertes.de wrote:
Hello everybody,
how well do WAI, Yesod and the 'persistent' package play with
concurrency? For
Francesco Mazzoli f at mazzo.li writes:
At the end I gave up and I wrote the function myself:
http://hpaste.org/43464/readbitmapfile
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
There is a common idiom used in Control.Concurrent libraries, as
embodied in the implementation of bracket:
http://www.haskell.org/ghc/docs/7.0-latest/html/libraries/base-4.3.0.0/src/Control-Exception-Base.html#bracket
bracket before after thing =
mask $ \restore - do
a - before
r -
On 31 January 2011 14:17, Leon Smith leon.p.sm...@gmail.com wrote:
Is there some subtle semantic difference? Is there a performance
difference? It seems like a trivial thing, but I am genuinely
curious.
According to my understanding the two should have equivalent
semantics. As for
I'm mapping a function over a list of data, where the mapping function is
determined from the data.
g f l = map (g l) l
So
g serialize prolog - [4,5,3,2,3,1]
But I'm having typing problems trying to do a similar thing with a function
that statistically normalizes data.
See:
On Monday 31 January 2011 18:29:59, michael rice wrote:
I'm mapping a function over a list of data, where the mapping function
is determined from the data.
g f l = map (g l) l
g f l = map (f l) l
probably
So
g serialize prolog - [4,5,3,2,3,1]
But I'm having typing problems trying to
Michael,
just leaving out the type declaration for 'normalize', your module
complies fine and ghc infers the following type:
normalize :: (Integral a, Floating a) = [a] - a - a
Note that the context (Integral a, Floating a) cannot be met by any of
the standard types. (try in ghci: :i
On Thu, Jan 27, 2011 at 7:28 AM, aditya siram aditya.si...@gmail.com wrote:
Ye gods! A B D [1] language for kids? At least give them a fighting
chance [2] at becoming future developers.
Haskell's immutability is good for mathematics but doing anything else
takes a great deal of up-front
I need some help if possible with the following problem.The WalkSat
algorithm takes a formula, a probability 0 = p = 1, and a
boundary of maximum flips maxflips
and returns a model that satisfies the formula or failure. The algorithm begins
by assigning truth values to
the atoms randomly,
Hi all,
I'm trying to convert wai-handler-devel to use plugins instead of
hint, but cannot even get some basic usages to work properly. I've put
together a minimal example that loads a WAI application from a
separate file and runs it, but this immediately causes the program to
crash saying:
On Mon, Jan 31, 2011 at 9:11 PM, Manolache Andrei-Ionut
andressocrate...@yahoo.com wrote:
I need some help if possible with the following problem.The WalkSat
algorithm takes a formula, a probability 0 = p = 1, and a boundary of
maximum flips maxflips
and returns a model that satisfies
I hadn't considered the types of the functions I call in the function I'm
trying to write, something not usually needed in loosely typed languages with
coercion, but something I'm going to have to make a habit of doing. One more
thing to add to the check list.
Also, I had considered the
thank you
--
View this message in context:
http://haskell.1045720.n5.nabble.com/Haskell-WalkSat-algorithm-implementation-tp3365064p3365124.html
Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.
___
Haskell-Cafe mailing list
tldr: Can I make arbitrary instances of one class instantiate another without
using wrappers?
I'm new to Haskell, and am trying to implement some simple typeclasses for
doing algebra. For example I have type class (simplified for the sake of
argument)
class AbGroup a where
add :: a - a - a
On 01/31/2011 08:58 PM, MattMan wrote:
[...]
data Wrapper a = Wrap a
instance (Num a) = AbGroup (Wrapper a) where
add (Wrap i) (Wrap j) = Wrap(i+j)
However, this is clumsy. Is there something else I can do? Thanks
This is the normal approach. You can do funny things with the
On Monday 31 January 2011 20:58:02, MattMan wrote:
tldr: Can I make arbitrary instances of one class instantiate another
without using wrappers?
I'm new to Haskell, and am trying to implement some simple typeclasses
for doing algebra. For example I have type class (simplified for the
sake
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 1/31/11 15:24 , Daniel Fischer wrote:
want. You could then also enable OverlappingInstances, which would allow
you to write other instances, but that extension is widely regarded as
dangerous (have to confess, I forgot what the dangers were,
On Mon, 31 Jan 2011, MattMan wrote:
I'm new to Haskell, and am trying to implement some simple typeclasses for
doing algebra. For example I have type class (simplified for the sake of
argument)
class AbGroup a where
add :: a - a - a
I would like any type instantiating Num to also be an
On Mon, 31 Jan 2011, Brandon S Allbery KF8NH wrote:
On 1/31/11 15:24 , Daniel Fischer wrote:
want. You could then also enable OverlappingInstances, which would allow
you to write other instances, but that extension is widely regarded as
dangerous (have to confess, I forgot what the dangers
I'm an undergraduate CS student (4th year status) looking for an co-op
or internship in the Rochester area. I'd really like to do something
with functional programming or Haskell specifically, but I'm not sure
if anyone in this area does that. Staying near Rochester is important
because I'd also
Hello,
I recently tried to upgrade some package (eg. yesod) and it seems
that, in the process, I screwed up my Haskell packages setup.
When I am trying to do a simple:
ghc --make Crete1941
It fails with message:
Loader\Communication.hs:14:7:
Could not find module `System.Process':
Use
On Monday 31 January 2011 23:59:57, Arnaud Bailly wrote:
Hello,
I recently tried to upgrade some package (eg. yesod) and it seems
that, in the process, I screwed up my Haskell packages setup.
Big time.
When I am trying to do a simple:
ghc --make Crete1941
It fails with message:
On Mon, Jan 31, 2011 at 4:59 PM, Arnaud Bailly arnaud.oq...@gmail.com wrote:
Hello,
I recently tried to upgrade some package (eg. yesod) and it seems
that, in the process, I screwed up my Haskell packages setup.
When I am trying to do a simple:
ghc --make Crete1941
What command(s) did you
\quote
Henning Thielemann wrote:
If all methods of AbGroup can be defined for all Num types - why do you
want an AbGroup at all? You could simply write functions with Num
constraint.
Well, I'd rather not have to implement (*), abs, etc on every abelian group.
You may be also
Hi Michael,
plugins use it's own function instead GHC API, so it's easy to break
with new version GHC.
-- Andy
Michael Snoyman mich...@snoyman.com
writes:
Hi all,
I'm trying to convert wai-handler-devel to use plugins instead of
hint, but cannot even get some basic usages to work
On 31 January 2011 21:40, Francesco Mazzoli f...@mazzo.li wrote:
Francesco Mazzoli f at mazzo.li writes:
At the end I gave up and I wrote the function myself:
http://hpaste.org/43464/readbitmapfile
cool ... the listed maintainer for the Xlib bindings is
librar...@haskell.org. Perhaps you
I'm using haskell-mode-2.8.0 and emacs 22.2.1 on Ubuntu 9.10
The following elisp code works for me to change the focus to the GHCi buffer
(window) after the C-c C-l command in Haskell Mode. Try this in your .emacs
file.
(defadvice inferior-haskell-load-file (after change-focus-after-load)
Oops, I guess I misinterpreted package description. It did sound a little
dangerous ;-).
What you suggested also worked. I'm in good shape now.
Thanks again,
-Ryan
On Mon, Jan 31, 2011 at 11:24 AM, Duncan Coutts
duncan.cou...@googlemail.com wrote:
On Mon, 2011-01-31 at 09:52 -0500, Ryan
Small update:
I got the first results from the hardware accelerated version on a 3.33 ghz
westmere machine. Right now it does twice as well as the Gladman software
version, which is also twice as well as the System.Random stdgen, and 1000
times faster than a the Haskell implementation of AES
Hi,
Thanks for your answers.
I did
cabal upgrade yesod
As for the user/global issue, I think I tried a user install, this is
default isn't it?
Looks like I will have to reinstall everything :-(
Arnaud
On Tue, Feb 1, 2011 at 1:34 AM, Antoine Latter aslat...@gmail.com wrote:
On Mon, Jan 31,
34 matches
Mail list logo
