On 08/04/2015 07:52, Magnus Therning wrote:
Yeah, my goal is to re-introduce it in ArchHaskell as soon as possible after
an upstream release that's buildable with 7.10.1. You are all more than
welcome to help me keeping an eye on their releases.
John has also recently started talk of a new
Tom Murphy amindfv at gmail.com writes:
Is there a way to install HP without XCode? Could there be in the
future? I'm tired of dealing with Apple's constant upgrade
requirements, registration requirements, etc., and it seems like a
small function that XCode actually performs in the Haskell
Mark Lentczner mark.lentczner at gmail.com writes:
As the README at that repository states, For 10.7 and later Apple now
distributes a Command Line Tools package on the developer site.
When I build and release the Haskell Platform, I confirm that works
when just this package is installed
, etc.)
can be found at http://www.inf.ed.ac.uk/teaching/courses/inf1/fp/ .
Joao H de A Franco
2012/10/24 Richard Wallace rwall...@thewallacepack.net
In case you haven't seen it, there is an intro to Haskell video series
by Erik Meijer on Channel9. There aren't any graded assignments or
anything
.
Hopefully you have some solution how to kill the thread and/or close the handle
and/or have some other idea to get the lined input in the other thread.
--
Thanks in advance
H.
___
Haskell-Cafe mailing list
Haskell
)
and
import Data.Ratio
newtype Fixed e = F Rational deriving (Eq, Ord, Enum, Real, RealFrac)
H.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ivan Lazar Miljenovic ivan.miljenovic at gmail.com writes:
I'm sorry, but is there a question in there?
H. h._h._h._ at hotmail.com writes:
(7e-3 :: BigFloat Prec50) (6e-4 :: BigFloat Prec50)
False
(7e-3 :: BigFloat Prec50) (8e-4 :: BigFloat Prec50)
True
7e-3 8e-4
Antoine Latter aslatter at gmail.com writes:
On Sun, Mar 21, 2010 at 4:49 PM, H. h._h._h._ at hotmail.com wrote:
7e-3 8e-4
The result should be False, but it's True.
Basically I don't know where to report this bug.
Sending to the maintainer of the package, as listed on hackage
Why not just create a wiki?
- S
On 17.11.2009 01:54, Günther Schmidt wrote:
Hi James,
it's still very very far away from even a single line of code. I'd
need a medium to lay this out first and discuss the idea. I'd normaly
use this list, but I think it's a bit too volatile a medium for
Hello,
Nobody any idea?
I want to paint in some widget, but this will be in front of some
background, so the bg should be transparent.
--
best regards
h.
--
View this message in context:
http://www.nabble.com/rotate-image-tp25122912p25198054.html
Sent from the Haskell - Haskell-Cafe
, but a drawingArea created with
drawingAreaNew has a rectangular shape and a color.
This is the problem.
--
best regards
h.
--
View this message in context:
http://www.nabble.com/rotate-image-tp25122912p25199462.html
Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com
with
imageNewFromFile with transparency.
Thanks in advance for your help.
--
Best regards
H.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
You could use Cairo. Load the image to a surface, then rotate the surface
10 degrees and paint it.
The first steps aren’t problematic, but how can I paint it - in which widget
- so that the background is transparent, with drawingArea it doesn’t seem to
work.
--
best regards
H
Hello,
You could use Cairo. Load the image to a surface, then rotate the surface 10
degrees and paint it.
The first steps aren’t problematic, but how can I paint it - in which widget -
so that the background is transparent, with drawingArea it doesn't seem to
work.
--
best regards
H
regards
H.
From: jefferson.r.he...@gmail.com
Date: Mon, 24 Aug 2009 19:40:46 -0400
Subject: Re: [Haskell-cafe] Re: rotate image
To: h._h._...@hotmail.com
CC: haskell-cafe@haskell.org
ahh, you want to paint against the desktop, then, yes? That requires
compositing, and I'm not sure there's
Hi,
It would be nice if you could package this and release it on hackage.
http://hackage.haskell.org/packages/hackage.html
I packaged it, perhaps you can have a look at it, if it is, what you thought...
When I get a username, I'll put it on hackage :)
--
H
, and everything works as I expected it. I
would be happy if someone else could test it and/or report if some important
escape codes are missing.
--Sincerely H.
_
Erweitere dein digitales Leben. Hol dir jetzt gratis das neue Windows Live.
http
there have to be included further notes about the libraries and/or there
license
--
Thanks in advance,
H.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
0.00s ( 0.01s elapsed)
Total time0.43s ( 0.49s elapsed)
But 8MB seems still too much, how can it be further optimised?
--
Best Regards
and
thanks for you answers in advance
H.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
-[a,a*2..k]]
--
--
Thanks for you answers in advance
H.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
write it as an example?
--
Regards,
H.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
--
Joseph H. Fasel, Ph.D.
Process Modeling and Analysis
AET-2, MS F609
Los Alamos National Laboratory
Los Alamos, NM 87545
___
Haskell-prime
Thanks a lot.
I hope I can learn from your lines and ideas used here to improve future code
in quality.
--
Best regards
h.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I have in mind something as connections via pipes to the chils's stdin, stdout
and stderr, but the stream library just supports internal pipes, and posix
require Unix. By this means it's not possible to request, receive and than
respond,... with the process. Does there exist an alternative way?
Jules Bean jules at jellybean.co.uk writes:
Well that depends entirely what your program is supposed to do.
Your email doesn't tell us (a) what your program was supposed to do or
(b) what goes wrong. Therefore we are forced to guess!
The following slight variation of your program works
Albert Y. C. Lai trebla at vex.net writes:
h. wrote:
module Main where
main :: IO ()
main = f
where
f = do
a - getLine
if a == quit then return () else putStrLn a f
This one also needs to switch to line buffering. Add/Change:
import System.IO(stdout
Hello,
I need to interact with some other program, and wrote the following code:
module Main where
import System.Process
import System.IO
main :: IO ()
main = do
putStrLn Running proc9...
(inp,out,err,pid) - runInteractiveProcess prog1 [] Nothing Nothing
hSetBuffering
type system.
Cheers,
Andrew Bromage
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Joseph H. Fasel, Ph.D. email: [EMAIL PROTECTED]
Stockpile-Complex Modeling
Hi Wolfgang,
Thanks for your informative reply. At first I didn't
understand it, but a search on StateT lead me to the
paper Monad Transformers and Modular Interpreters by
Liang, Hudak and Jones, which clarified some of the
ideas for me.
The state transformer approach seems to have
advantageous
On Tue, 2004-01-06 at 22:58, Graham Klyne wrote:
I'm not an expert in this, but I think what you are proposing is possible,
to a point, possibly assuming that your monads have associated functions to
combine and separate the monadic parts.
Thanks for the below illustration of how this
Hi,
Does anyone have ever used this option?
I see no difference when I present this program to ghc
with -fallow-overlapping-instances on/off:
module Test where
data T = T
data F = F
data OR a b = OR a b
data AND a b = AND a b
class C a b | a - b
instance C (OR T r) T
instance C (OR r T) T
Thanks to all the people who responded to my question!
The solution from Wolfgang Jeltsch:
(f.).g
was what I was after. But the other responses were
useful also.
Thanks!
Mark.
On Thu, 2003-07-17 at 09:57, Dr Mark H Phillips wrote:
Hi,
Hopefully this is a simple question. I am wanting
.
--
Dr Mark H Phillips
Research Analyst (Mathematician)
AUSTRICS - smarter scheduling solutions - www.austrics.com
Level 2, 50 Pirie Street, Adelaide SA 5000, Australia
Phone +61 8 8226 9850
Fax +61 8 8231 4821
Email [EMAIL PROTECTED]
___
Haskell
20180
your penultimax2 746610344
your penultimax3 860513782
Hope this helps (or at least, is entertaining :-)
Yes. Thanks!
Mark.
--
Dr Mark H Phillips
Research Analyst (Mathematician)
AUSTRICS - smarter scheduling solutions - www.austrics.com
Level 2, 50
. Is there documentation on List.hs, along the lines
of the A Tour of the Haskell Prelude?
Thanks,
Mark.
--
Dr Mark H Phillips
Research Analyst (Mathematician)
AUSTRICS - smarter scheduling solutions - www.austrics.com
Level 2, 50 Pirie Street, Adelaide SA 5000, Australia
Phone +61 8 8226 9850
Fax
= (m,p)
| mq = (p,m)
| otherwise = (p,q)
where
(p,q) = maxpenmax ms
How do I work out which is best to use? Is there
one clear winner, or will they each have pros and
cons?
Thanks,
Mark.
--
Dr Mark H Phillips
Research Analyst (Mathematician)
AUSTRICS - smarter scheduling
the unary - has
weak binding?
--
Dr Mark H Phillips
Research Analyst (Mathematician)
AUSTRICS - smarter scheduling solutions - www.austrics.com
Level 2, 50 Pirie Street, Adelaide SA 5000, Australia
Phone +61 8 8226 9850
Fax +61 8 8231 4821
Email [EMAIL PROTECTED
Thanks for the explanation!
On Tue, 2002-09-17 at 19:07, Brian Boutel wrote:
You can't do this because where clauses are not part of the expression
syntax. If they were, expressions like
let a=b in c where d=e
or
if a then b else c where d=e
whould be ambiguous, unless you
On Wed, 2002-09-18 at 01:26, Hamilton Richards wrote:
You can get the effect you're after by using let-expressions:
functn :: Int - Int
functn i
| i5 = let t = functn (i-2) in t * i
| i0 = let t = functn (i-1) in t * i
| otherwise = 1
'where' is part
doing something wrongly, or is there a good reason why
where isn't allowed to be used in this way?
Thanks,
Mark.
--
Dr Mark H Phillips
Research Analyst (Mathematician)
AUSTRICS - smarter scheduling solutions - www.austrics.com
Level 2, 50 Pirie Street, Adelaide SA 5000, Australia
Phone +61 8
On Wed, 2002-08-21 at 17:50, Dylan Thurston wrote:
This is the same as one way of representing search trees, called a
trie. Two representations in Haskell are:
data Trie a = Trie [(a, Trie a)]
I touched on the following in my response to Hal Daume's email, but it's
probably worth asking
Hi,
Consider the following data structure, effectively
of type [[(Int,Int)]]:
(2,5) (1,3) (2,0)
(2,5) (1,2) (1,1) (1,0)
(2,5) (3,1)
(1,5) (2,4) (2,0)
(1,5) (1,4) (1,3) (1,1) (1,0)
(1,5) (1,4) (2,2) (1,0)
(1,5) (1,4) (1,2) (2,1)
(1,5) (2,3) (1,2) (1,0)
(1,5) (2,3) (2,1)
(1,5) (1,3) (2,2) (1,1)
On Wed, 2002-08-21 at 16:52, Hal Daume III wrote:
I would consider using a prefix trie. Unfortunately, such a structure is
not built in to Haskell.
Thanks for this! It seems that this kind of data structure is what I
am looking for.
[begin aside]
It seems a pity that one needs to give
M. Faisal Fariduddin Attar Nasution wrote:
Greeting, I'm a last year student in a computer science field. I'm
currently trying to code an implementation for a compression using
basic Lempel-zif technique. I use a Trie (retrieval) as a data
structure for the dynamic
As suggested by the README, I did
./configure --exec-prefix=/home/sml/bin/ia32-linux --enable-hc-boot
make boot
make
and then I get the following error:
===fptools== Finished making `all' in cbits ...
PWD =
I've been trying to install the last couple of ghc releases (from
various linux binaries). Installation itself goes OK, but ghc dies on
the lack of libgmp.so.2.
Unfortunately, the only libgmp releases I've seen build only a static
library.
Am I (no doubt) missing something?
Thanks,
--ag
--
Hey:
In attempting to build ghc-3.02 I get the following
error as a result of 'make boot':
make[2]: execvp: ghc-2.10: Too many symbolic links encountered
make[2]: *** [depend] Error 127
make[1]: *** [boot] Error 1
make: *** [boot] Error 1
Have I perhaps mis-installed something previously?
Jorgen Frojk Kjaersgaard [EMAIL PROTECTED] wrote:
It might be a good idea to publish GHC under the GNU Public License or
something similar. It grants everybody the right to use the software for
any purpose, including making extensions or modifications of it - as long
as the "derived work" is
Call for Papers
FPLE'95
Symposium on Functional Programming Languages
in Education
December 03-06, 1995
Moscow, Russia
the
Call for Papers
FPLE'95
Symposium on Functional Programming Languages
in Education
December 03-06, 1995
Moscow, Russia
the
I posted this to the mailing list back in October or November, but
I thought I'd repost it before the 1 February deadline. The ad also appears
in the December 1994 CACM.
- Conrad Cunningham
UNIVERSITY OF
Journal of Functional Programming - call for Papers
Special issue on state-of-the-art applications
of pure functional programming languages
A special issue of the Journal of Functional Programming will be
devoted to presenting state-of-the-art applications of pure
52 matches
Mail list logo
