Yes
On 23/11/11 19:11, heathmatlock wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi,
I would like to use Haskell to generate automatically a poster.
I guess that would be using Cairo so I can have a 2d canvas to draw in
and maybe even preview before exporting to PDF.
However, I can't find any documentation on Cairo with Haskell or any
code examples related to what I want
Thanks I will take a look at those.
On 15/04/11 15:12, Robert Wills wrote:
Have a look at
http://hackage.haskell.org/package/diagrams
and
http://hackage.haskell.org/package/Hieroglyph
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 15/04/11 15:19, Chris Smith wrote:
To answer my own email, yes, PDF support is there.
Great, I assume it would also allow me to preview it on a GTK canvas, right?
--
PMatos
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 15/04/11 16:13, John Obbele wrote:
bash $ mkdir /tmp/uncabal cd /tmp/uncabal
bash $ cabal unpack cairo
bash $ cd /tmp/uncabal/cairo-*/demo
bash $ runghc StarAndRing.hs
The gtk2hs bindings are generaly pretty dumb and just mimic the
original C behaviour. So the best source of documentation
Hi all,
I am trying to install agda through cabal but I get this:
$ cabal install alex
Resolving dependencies...
[1 of 1] Compiling Main
( /tmp/alex-2.3.116333/alex-2.3.1/Setup.lhs,
/tmp/alex-2.3.116333/alex-2.3.1/dist/setup/Main.o )
/tmp/alex-2.3.116333/alex-2.3.1/Setup.lhs:6:51:
Warning:
On Fri, 2009-06-19 at 15:35 -0500, Jake McArthur wrote:
Paulo J. Matos wrote:
As you can see, I had just finished installing alex 2.3.1, so why does
cabal still request alex =2.0.1 3?
Probably you don't have alex in your PATH.
- Jake
Shouldn't cabal make sure the library it installs
On Fri, 2009-06-19 at 23:35 +0200, Max Rabkin wrote:
On Fri, Jun 19, 2009 at 11:20 PM, Paulo J. Matospocma...@gmail.com wrote:
Shouldn't cabal make sure the library it installs are in PATH?
This would require modifying the path (since there may be no writable
location on the existing path).
On Mon, Feb 2, 2009 at 10:04 PM, Don Stewart d...@galois.com wrote:
pocmatos:
Hi all,
Much is talked that Haskell, since it is purely functional is easier
to be verified. However, most of the research I have seen in software
verification (either through model checking or theorem proving)
On Tue, Feb 3, 2009 at 12:28 AM, Don Stewart d...@galois.com wrote:
dbueno:
On Mon, Feb 2, 2009 at 15:04, Don Stewart d...@galois.com wrote:
pocmatos:
Hi all,
Much is talked that Haskell, since it is purely functional is easier
to be verified. However, most of the research I have
Hi all,
Much is talked that Haskell, since it is purely functional is easier
to be verified.
However, most of the research I have seen in software verification
(either through model checking or theorem proving) targets C/C++ or
subsets of these. What's the state of the art of automatically
Hello all,
I find it funny that IO () is different from IO [()].
For example, if I define a function to output some lines with mapT, I would do:
outputLines :: Int - IO ()
outputLines i = mapM (putStrLn . show) (take i $ iterate ((+) 1) 1)
However, this is in fact
outputLines :: Int - IO [()]
I
On Jan 25, 2008 11:40 AM, Simon Peyton-Jones [EMAIL PROTECTED] wrote:
Would you be interested in working at Microsoft Research for three months?
If so, you might want to think about applying for an internship.
Simon and I are looking for interns, starting in summer 2008. Lots of
???
--or to be clearer without syntactic sugar, that is
parseHeader3 bs =
(BS.readInt $ BS.dropWhile (not . isDigit) bs)
= \(x, rest) -
(BS.readInt $ BS.dropWhile (not . isDigit) rest)
= \(y, _) -
return (x, y)
Isaac
Paulo J. Matos wrote:
On Dec 23
On Dec 24, 2007 11:55 AM, Paulo J. Matos [EMAIL PROTECTED] wrote:
On Dec 23, 2007 12:44 PM, Isaac Dupree [EMAIL PROTECTED] wrote:
-- this should work too
parseHeader3 :: BS.ByteString - Maybe (Int, Int)
--note accurate type signature, which helps us use Maybe failure-monad,
--although
Hello all,
It is either too difficult to get two integers of a bytestring, in
which case something should be done to ease the process or I should
learn much more Haskell. I guess the latter is the correct guess.
I have a bytestring containing two naturals. I was to get them as
efficiently as
On Dec 23, 2007 12:32 PM, Paulo J. Matos [EMAIL PROTECTED] wrote:
Hello all,
It is either too difficult to get two integers of a bytestring, in
which case something should be done to ease the process or I should
learn much more Haskell. I guess the latter is the correct guess.
I have
Hello all,
I using an IArray to represent a matrix. I'm trying to write some
properties checks with Quickcheck.
Quickcheck lacks instance generators for arrays of ints for example,
is there anything I can use out there or should I define it myself?
(I'm asking because it seems to be something
On Dec 3, 2007 12:39 PM, Albert Lee [EMAIL PROTECTED] wrote:
I have been confussed by monad for a long time. and I can't stand for
it any more. so I start to translate the tutorial All About Monads
to my mother language Chinese.
My English is not good enough, so this work is only for my own
I'm glad that my initial post generated such an interesting discussion
but I'm still not understanding why the first version of findAllPath
seems to be computing the whole list even when I just request the
head, while the second one doesn't. I thought that this was
denominated by findAllPath is
On Dec 5, 2007 1:51 PM, Luke Palmer [EMAIL PROTECTED] wrote:
On Dec 4, 2007 9:41 PM, Paulo J. Matos [EMAIL PROTECTED] wrote:
Hello all,
As you might have possibly read in some previous blog posts:
http://users.ecs.soton.ac.uk/pocm06r/fpsig/?p=10
http://users.ecs.soton.ac.uk/pocm06r
On Dec 5, 2007 1:43 PM, Benja Fallenstein [EMAIL PROTECTED] wrote:
Hi Paolo,
On Dec 5, 2007 2:09 PM, Paulo J. Matos [EMAIL PROTECTED] wrote:
I'm glad that my initial post generated such an interesting discussion
but I'm still not understanding why the first version of findAllPath
seems
On Dec 4, 2007 10:00 PM, Neil Mitchell [EMAIL PROTECTED] wrote:
Hi
findAllPath :: (a - Bool) - (BTree a) - [[a]]
findAllPath pred = g where
g (Leaf l) | pred l = [[l]]
g (Branch lf r rt) | pred r = map (r:) $ (findAllPath pred
lf) ++ (findAllPath pred rt)
On Dec 5, 2007 10:44 AM, Jules Bean [EMAIL PROTECTED] wrote:
Paulo J. Matos wrote:
Hello all,
Hi.
findAllPath :: (a - Bool) - (BTree a) - Maybe [[a]]
findAllPath pred (Leaf l) | pred l = Just [[l]]
| otherwise = Nothing
findAllPath pred (Branch lf r rt
On Dec 5, 2007 12:16 AM, Aaron Denney [EMAIL PROTECTED] wrote:
On 2007-12-04, Paulo J. Matos [EMAIL PROTECTED] wrote:
Hello all,
As you might have possibly read in some previous blog posts:
http://users.ecs.soton.ac.uk/pocm06r/fpsig/?p=10
http://users.ecs.soton.ac.uk/pocm06r/fpsig/?p=11
Hello all,
As you might have possibly read in some previous blog posts:
http://users.ecs.soton.ac.uk/pocm06r/fpsig/?p=10
http://users.ecs.soton.ac.uk/pocm06r/fpsig/?p=11
we (the FPSIG group) defined:
data BTree a = Leaf a
| Branch (BTree a) a (BTree a)
and a function that
Thanks all for your suggestions.
On Nov 23, 2007 10:31 PM, Duncan Coutts [EMAIL PROTECTED] wrote:
On Fri, 2007-11-23 at 20:22 +, Paulo J. Matos wrote:
Hi all,
I'm curious about the best way to typeset haskell code in a wordpress
blog. Using blockquote removes all indentation
Hi all,
I'm curious about the best way to typeset haskell code in a wordpress
blog. Using blockquote removes all indentation. :-(
Cheers,
--
Paulo Jorge Matos - pocm at soton.ac.uk
http://www.personal.soton.ac.uk/pocm
PhD Student @ ECS
University of Southampton, UK
On 01/11/2007, Simon Peyton-Jones [EMAIL PROTECTED] wrote:
Yes, that's right. We'll be doing a lot more work on the code generator in
the rest of this year and 2008. Here we includes Norman Ramsey and John
Dias, as well as past interns Michael Adams and Ben Lippmeier, so we have
real
Hello all,
I, along with some friends, have been looking to Haskell lately. I'm
very happy with Haskell as a language, however, a friend sent me the
link:
http://shootout.alioth.debian.org/gp4/
which enables you compare several language implementations. Haskell
seems to lag behind of Clean.
From
On 31/10/2007, Peter Hercek [EMAIL PROTECTED] wrote:
Add to that better unbox / box annotations, this may make even
bigger difference than the strictness stuff because it allows
you to avoid a lot of indirect references do data.
Anyway, if Haskell would do some kind of whole program
Hello all,
I'm interested in a freely available fast paced haskell tutorial.
By fast paced, I means I want something that goes through basic in a
very fast pace, presents a couple of examples and then talks about
more advanced features. A set of tutorials would be also good.
References to these
Thank you all for your references and tips, I'll be using them. :-)
On 06/08/2007, Jules Bean [EMAIL PROTECTED] wrote:
Thomas Schilling wrote:
On 6 aug 2007, at 22.11, Paulo J. Matos wrote:
If you're used to Slime+Paredit, then there isn't something really
comparable, but you get some
Hi all,
I'm starting to learn haskell by my own, being currently mostly a
Common Lisp, Scheme, C++ programmer... I've got the haskell emacs mode
but can't find a manual. Moreover, I've found some keybindings on the
net but nothing that allows me to start an interpreter in emacs and
send
34 matches
Mail list logo
