Ivan Lazar Miljenovic [EMAIL PROTECTED] wrote:
This report contains visualisation of the code for each module, for
the imports (similar to what graphmod [5] does) as well as the entire
code base.
We cna haz screenshotz?
--
(c) this sig last receiving data processing entity. Inspect headers
Hello Nun,
Monday, November 3, 2008, 6:18:12 AM, you wrote:
How do I make a minimal Windows application in Haskell? I know
you should look at Win32 package sources which includes small example
using WinAPI for hello world GUI application
but note that Win32 binding is far from complete. if i
Hello Maurício,
Monday, November 3, 2008, 4:43:26 AM, you wrote:
darcs add .emacs
darcs get http://code.haskell.org/MauricioAntunes
thank, it's a great ideas! and don't forget that you can use
code.haskell.org as online backup of history of your config files
Nice. Just did that,
On Sun, 2008-11-02 at 23:43 -0200, Maurício wrote:
Then I thought community.haskell.org could offer a default darcs
repositories for all users named after their owners. For instance,
if you want to check my personal files you would do:
darcs get http://code.haskell.org/MauricioAntunes
David Roundy wrote:
On Sun, Nov 02, 2008 at 09:15:25PM +0100, Marc Weber wrote:
On Mon, Nov 03, 2008 at 01:02:12AM +1100, Rafal Kolanski wrote:
Rafal Kolanski.
[...]
Why do you use forkIO here? It's not necessary. The process will run in
background on its own. ?
It looks to me like this
On Mon, 3 Nov 2008, Mauricio wrote:
Hello Maurício,
Monday, November 3, 2008, 4:43:26 AM, you wrote:
darcs add .emacs
darcs get http://code.haskell.org/MauricioAntunes
thank, it's a great ideas! and don't forget that you can use
code.haskell.org as online backup of history of your
On Fri, 2008-10-31 at 14:55 -0400, Jefferson Heard wrote:
Installing gtk2hs from MacPorts on a clean mac:
svgcairo/Graphics/Rendering/Cairo/SVG.chs:201:2:
Couldn't match expected type `()' against inferred type `CInt'
The latest major release of the cairo C lib changed the API to return
On Mon, Nov 3, 2008 at 11:31 AM, Tobias Bexelius
[EMAIL PROTECTED] wrote:
Before Direct3D 10, its too costly to read back the updated vertex data
in every frame, which force you to make this kind of operations on the
CPU.
With D3D 10 however, you should use the new Stream-Output stage which is
On Sun, Nov 2, 2008 at 7:53 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Bertram Felgenhauer wrote:
It's not going to be fixed by itself - the first comment for the
bug report basically asks interested parties to submit a proposal
for changing this.
Well I certainly don't have the skill to
On Mon, 3 Nov 2008, Svein Ove Aas wrote:
On Sun, Nov 2, 2008 at 7:53 PM, Andrew Coppin
In my opinion, what we should have is
1. An interface that is guaranteed-safe, no matter how inefficient that is.
2. An interface that is guaranteed-efficient, no matter how unsafe that is.
3. It should
Henning Thielemann [EMAIL PROTECTED] writes:
I think it is a good idea to switch this feature on and off by a
compiler switch.
I agree. Same with Int overflow checking, if it can be done at all.
The interesting question is how to name it, the obvious
-funsafe-optimization
might imply
Hi everyone,
I was experimenting with simple accumulator functions, and found that an
apparently tail recursive function can easily fill the stack. Playing
around with ghc and jhc gave consistently unpleasant results. Look at
this program:
%%%
-- ghc: no, ghc -O3: yes, jhc: no
isum 0 s
how can we use those from MacPorts? Is it possible?
On Mon, Nov 3, 2008 at 5:59 AM, Duncan Coutts
[EMAIL PROTECTED] wrote:
On Fri, 2008-10-31 at 14:55 -0400, Jefferson Heard wrote:
Installing gtk2hs from MacPorts on a clean mac:
svgcairo/Graphics/Rendering/Cairo/SVG.chs:201:2:
Couldn't
Rafal Kolanski wrote:
..., until I found someone's code
snippet online ... and extrapolated from that.
Oh yes, I love that kind of programming. Hardly possible in other
languages than Haskell. :-)
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
On Mon, 2008-11-03 at 09:10 -0500, Jefferson Heard wrote:
how can we use those from MacPorts? Is it possible?
Either use macports to downgrade to an older version of the cairo C lib,
or grab the darcs version of gtk2hs and try that. If macports only
supports has one version of a lib at once (I
On Mon, 2008-11-03 at 13:31 +0100, Patai Gergely wrote:
Hi everyone,
I was experimenting with simple accumulator functions, and found that an
apparently tail recursive function can easily fill the stack. Playing
around with ghc and jhc gave consistently unpleasant results. Look at
this
patai_gergely:
Hi everyone,
I was experimenting with simple accumulator functions, and found that an
apparently tail recursive function can easily fill the stack. Playing
around with ghc and jhc gave consistently unpleasant results. Look at
this program:
%%%
-- ghc: no, ghc
ketil:
Henning Thielemann [EMAIL PROTECTED] writes:
I think it is a good idea to switch this feature on and off by a
compiler switch.
I agree. Same with Int overflow checking, if it can be done at all.
The interesting question is how to name it, the obvious
Ketil Malde [EMAIL PROTECTED] wrote:
Henning Thielemann [EMAIL PROTECTED] writes:
I think it is a good idea to switch this feature on and off by a
compiler switch.
I agree. Same with Int overflow checking, if it can be done at all.
The interesting question is how to name it, the
Excerpts from t.r.willingham's message of Sun Nov 02 17:28:08 -0600 2008:
What would it take to implement a -j equivalent for, say, GHC? Or if
this is not possible, what is wrong with my reasoning?
Thanks,
TW
Hi,
The main issue has to do with the decisions the compiler needs to make
in
Bryan O'Sullivan wrote:
What is the it that segfaults? The Haskell program shouldn't, at least.
The Haskell program. It does so rarely, however, and I'm unable to
reproduce it with any consistency, only enough to notice something is
wrong with what I've written.
Upon closer examination my
Achim Schneider [EMAIL PROTECTED] writes:
-funsafe-optimization
-fno-paranoia
-fno-rd ?
(Okay, I'll stop now :-)
-k
--
If I haven't seen further, it is by standing in the footprints of giants
___
Haskell-Cafe mailing list
On Mon, 2008-11-03 at 20:21 +0100, Ketil Malde wrote:
Achim Schneider [EMAIL PROTECTED] writes:
-funsafe-optimization
-fno-paranoia
-fno-rd ?
-fpermit-program-to-crash
jcc
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Mon, Nov 3, 2008 at 4:55 PM, Henning Thielemann
I think it is a good idea to switch this feature on and off by a compiler
switch. It does not alter the correctness of a program. If the program is
incorrect, the switch does only affect the way how the program goes wrong.
I disagree.
In a
yet I need to add a $! to the recursive call of isum to get a truly
iterative ???
Wait a minute Patai. How would you do that? I'm only beginner I thought I
can only add strict ! to data parameters. But to make isum function strict
would be helpful.
Thanks
On Mon, Nov 3, 2008 at 7:36 PM, Don
Bulat Ziganshin [EMAIL PROTECTED] wrote:
ps: http://www.haskell.org/ghc/dist/stable/dist/ghc-6.10.1-src.tar.bz2
ghc-6.10.1\libraries\Win32\examples
Thanks for this.
I noticed some errors in the sample that might help others:
1) you need to replace win32 with Win32 in the given command
I forgot to cc to haskell-cafe:
-- Forwarded message --
From: Alberto G. Corona [EMAIL PROTECTED]
Date: 2008/11/2
Subject: Re: [Haskell-cafe] Re: [Haskell] ANNOUNCE: RefSerialize-0.2.1
To: Bulat Ziganshin [EMAIL PROTECTED]
* SerTH is a binary serialization library for Haskell.
actualized to 0.2.3 due to some errors in the cabal description. Sorry,
some needed module was not exported.
2008/11/2 Alberto G. Corona [EMAIL PROTECTED]
I uploadad
RefSerializehttp://hackage.haskell.org/cgi-bin/hackage-scripts/package/RefSerialize
to Hackage .
Read, Show and
On Mon, 3 Nov 2008, Svein Ove Aas wrote:
On Mon, Nov 3, 2008 at 4:55 PM, Henning Thielemann
I think it is a good idea to switch this feature on and off by a compiler
switch. It does not alter the correctness of a program. If the program is
incorrect, the switch does only affect the way how
I need to backup my ubuntu-VMWare image frequently (5 GBits) . I need to
know if exist such a utility (in haskell or not) for single file
syncronization.
I don´t want to reinvent te weel, but I think that it is a few lines of
Haskell using the Diff package or something similar.
On Mon, 2008-11-03 at 22:16 +0100, Alberto G. Corona wrote:
I need to backup my ubuntu-VMWare image frequently (5 GBits) . I
need to know if exist such a utility (in haskell or not) for single
file syncronization.
I don´t want to reinvent te weel, but I think that it is a few lines
of
frantisek.kocun:
yet I need to add a $! to the recursive call of isum to get a truly
iterative ???
Wait a minute Patai. How would you do that? I'm only beginner I thought I
can only add strict ! to data parameters. But to make isum function
strict would be helpful.
On Mon, 3 Nov 2008 22:16:14 +0100
Alberto G. Corona [EMAIL PROTECTED] wrote:
I need to backup my ubuntu-VMWare image frequently (5 GBits) . I
need to know if exist such a utility (in haskell or not) for single
file syncronization.
Why don't you just run rsync inside the virtual machine?
On Mon, Nov 3, 2008 at 2:35 PM, Don Stewart [EMAIL PROTECTED] wrote:
Consider this program,
isum 0 s = s
isum n s = isum (n-1) (s+n)
main = case isum 1000 0 {- rsum 1000 -} of
0 - print 0
x - print x
On Mon, Nov 3, 2008 at 2:49 PM, Luke Palmer [EMAIL PROTECTED] wrote:
I am confused about your usage of strict. Optimizations are not
supposed to change semantics, so I don't know how it is possible to
make a function strict by turning on optimizations. This function was
always strict in s,
lrpalmer:
On Mon, Nov 3, 2008 at 2:35 PM, Don Stewart [EMAIL PROTECTED] wrote:
Consider this program,
isum 0 s = s
isum n s = isum (n-1) (s+n)
main = case isum 1000 0 {- rsum 1000 -} of
0 - print 0
On Mon, Nov 3, 2008 at 2:54 PM, Don Stewart [EMAIL PROTECTED] wrote:
lrpalmer:
On Mon, Nov 3, 2008 at 2:35 PM, Don Stewart [EMAIL PROTECTED] wrote:
Consider this program,
isum 0 s = s
isum n s = isum (n-1) (s+n)
main = case isum 1000 0 {- rsum
Achim Schneider barsoap at web.de writes:
This report contains visualisation of the code for each module, for
the imports (similar to what graphmod [5] does) as well as the entire
code base.
We cna haz screenshotz?
Well, it's a console app that produces an HTML file, so there's not
On Mon, 3 Nov 2008, Luke Palmer wrote:
On Mon, Nov 3, 2008 at 2:54 PM, Don Stewart [EMAIL PROTECTED] wrote:
Optimisations enable strictness analysis.
I was actually being an annoying purist. f is strict means f _|_ =
_|_, so strictness is a semantic idea, not an operational one.
On Mon, Nov 3, 2008 at 5:39 PM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Mon, 3 Nov 2008, Luke Palmer wrote:
On Mon, Nov 3, 2008 at 2:54 PM, Don Stewart [EMAIL PROTECTED] wrote:
Optimisations enable strictness analysis.
I was actually being an annoying purist. f is strict means f
Hi,
Given a TypeRep and a Dynamic value with type corresponding to the
TypeRep, I'd like to be able to use fromDyn *without* specifying a type
(given as an additional 'default' argument) (since it is somewhat known
from the TypeRep).
That is, I'd like an undefinedOf that can be used in
extract
Don Stewart:
Optimisations enable strictness analysis.
Luke Palmer:
I was actually being an annoying purist. f is strict means f _|_ =
_|_, so strictness is a semantic idea, not an operational one.
Optimizations can change operation, but must preserve semantics.
Henning Thielemann:
Maybe I
Patai Gergely wrote:
Hi everyone,
I was experimenting with simple accumulator functions, and found that an
apparently tail recursive function can easily fill the stack. Playing
around with ghc and jhc gave consistently unpleasant results. Look at
this program:
%%%
-- ghc: no, ghc -O3:
On Mon, Nov 3, 2008 at 4:58 PM, minh thu [EMAIL PROTECTED] wrote:
Hi,
Given a TypeRep and a Dynamic value with type corresponding to the
TypeRep, I'd like to be able to use fromDyn *without* specifying a type
(given as an additional 'default' argument) (since it is somewhat known
from the
When using template haskell (via Derive) to generate this (exact) instance:
instance Foldable ((-) Int) = Foldable
Data.Derivable.InterpreterLib.Test.List
where foldMap f (Cons x0 x1) = (const mempty Cons `mappend`
foldMap f x0) `mappend` foldMap f x1
foldMap f (Nil) = const
minh thu asked a tricky question, about writing
extract :: Typeable a = TypeRep - Dynamic - a
The question here is what determines the type 'a'. One answer is that
'a' is determined from the context, e.g.,
(extract tr dyn) + 1.0
fixes 'a' to be an Int. In that case, extract is
2008/11/4, Antoine Latter [EMAIL PROTECTED]:
On Mon, Nov 3, 2008 at 4:58 PM, minh thu [EMAIL PROTECTED] wrote:
Hi,
Given a TypeRep and a Dynamic value with type corresponding to the
TypeRep, I'd like to be able to use fromDyn *without* specifying a type
(given as an additional 'default'
Ivan Lazar Miljenovic [EMAIL PROTECTED] wrote:
Achim Schneider barsoap at web.de writes:
This report contains visualisation of the code for each module,
for the imports (similar to what graphmod [5] does) as well as
the entire code base.
We cna haz screenshotz?
Well, it's a
Hi,
I got my ghc 6.8 by `darcs get --partial
http://darcs.haskell.org/ghc-6.8/ghc`, and after `darcs-all get`, `sh
boot`, `configure`, without any problem, I started to make it.
Well, when compiling libraries/stm, it reports
Control/Concurrent/STM/TVar.hs:22:8: Not in scope:
Nicolas Frisby [EMAIL PROTECTED] wrote:
When using template haskell (via Derive) to generate this (exact)
instance:
instance Foldable ((-) Int) = Foldable
Data.Derivable.InterpreterLib.Test.List
where foldMap f (Cons x0 x1) = (const mempty Cons `mappend`
foldMap f x0) `mappend`
50 matches
Mail list logo
