Hello Felipe,
Monday, February 8, 2010, 1:10:07 PM, you wrote:
>> As I understand Gtk2hs still don't run in -threaded environment.
> It does run, just use unsafeInitGUIForThreadedRTS.
... and run all GUI primitives via special wrapper or in GUI thread
--
Best regards,
Bulat
Hello Günther,
Tuesday, February 9, 2010, 4:03:48 AM, you wrote:
> how can I make ghc use a particular manifest file for embedding? (on
> Windows)
compile.cmd:
windres.exe -I. Register.rc res.o
g++.exe Register.cpp res.o
Register.rc:
1 24 "Register.exe
Hello Jason,
Wednesday, February 10, 2010, 6:59:42 PM, you wrote:
> I wonder how many people actually write Haskell,
> principally or exclusively, at work?
i work on commercial program. once it will start selling, i will
publish here the story
--
Best regards,
Bulat
Hello Yves,
Thursday, February 18, 2010, 2:10:42 AM, you wrote:
> Okay! So under UNIX, haskell threaded runtime uses pthreads, if I well
> understood.
not exactly. it still uses lightweight (green) threads, but starts
additional OS threads as required to keep N haskell threads running.
it's very
Hello Brandon,
Wednesday, February 24, 2010, 8:08:41 AM, you wrote:
>> I feel that ghci code executing speed in guest os is 1.5~2x faster
>> than host os
> My guess is that GHC (and the GHC RTS) on win32 is using a POSIX
> emulation layer supplied by mingw32 for all system calls, introducing
>
Hello Edward,
Wednesday, February 24, 2010, 10:32:59 PM, you wrote:
> I'd be really curious about techniques that permit mutation during
> the construction of functional datastructures; this seems like a cool
> way to get fast performance w/o giving up any of the benefits of
> immutability. Unfo
Hello Matthias,
Friday, March 5, 2010, 12:56:48 AM, you wrote:
>> [...] The SFLC holds that a
>> library that depends on a GPL'd library must in turn be GPL'd, even if
>> the library is only distributed as source and not in binary form.
> Was this a general statement
yes. it's soul of GPL idea,
Hello Maciej,
Monday, March 8, 2010, 4:33:08 PM, you wrote:
> PS. I understand that content may be flame-gen. I am sorry in advance if
> such circumstances happen. However I believe that possible improvements
> in process are worth the risk.
i was the author of this idea and i thought that
1) p
Hello Arnoldo,
Wednesday, March 10, 2010, 11:45:56 PM, you wrote:
> I am learning haskell and I found a space leak that I find
> difficult to solve. I've been asking at #haskell but we could not solve
> the issue.
make some experiments - leave only one file and use version A, then
replace append
Hello Arnoldo,
Wednesday, March 10, 2010, 11:45:56 PM, you wrote:
> I am learning haskell and I found a space leak that I find
> difficult to solve. I've been asking at #haskell but we could not solve
> the issue.
what if you use program B on single file?
--
Best regards,
Bulat
Hello aditya,
Saturday, April 3, 2010, 6:56:23 AM, you wrote:
> Haskell. And I'm also wondering why metaprogramming is used much more
> in Ocaml than in Haskell.
reasons are two-folded: haskell is more powerful language. in
particular, there are lots of generic programming approaches besides
TH.
Hello Haihua,
Friday, April 9, 2010, 8:28:23 PM, you wrote:
> In C++, template can be used to enforce the dimension. For example,
> F=m*a is OK and F=m*t will issue a compile time error.
> Is there a way to do this in Haskell?
yes. but standard * operation has type t->t->t. so you need either t
Hello Neil,
Thursday, April 15, 2010, 12:37:35 PM, you wrote:
> I find non-termination with a much simpler program than yours (GHC 6.12.1):
>forkIO $ do putStrLn "Started thread"
>forever $ return ()
ghc multithreading is actually cooperative: it switches only on memory
alloc
Hello Mathieu,
Friday, April 16, 2010, 12:06:06 PM, you wrote:
> actions and then running them using sequence_. But still this program
> runs 3 times slower than it's C counterpart:
ghc low-level code optimization cannot be compared with best modern C
compilers that's result of 20 years of optim
Hello Mathieu,
Friday, April 16, 2010, 12:42:29 PM, you wrote:
> Sure. But I was curious if to see whether there was some optimization
> I had missed, seeing as other similarly low level programs, such as
> the nsieve benchmark of the language shootout, or the word counting
> program, manage to r
Hello John,
Friday, April 16, 2010, 7:41:06 PM, you wrote:
>> sIZE = 1500
> and all references from "SIZE" to "sIZE", something ... changes. A lot.
this one too? :D
let loop2 SIZE = return ()
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
Hello Jason,
Saturday, April 17, 2010, 2:00:04 AM, you wrote:
> Well, I think Bulat correctly characterized the non-termination
> aspect. I didn't think the cooperative aspect of threading applied
> with the threaded RTS, so I'm not 100% sure I believe his
> characterization, but otherwise it s
Hello Bertram,
Sunday, April 18, 2010, 12:11:05 AM, you wrote:
> always a = -- let act = a >> act in act
> do
> _ <- a
> always a
>
> hinting at the real problem: 'always' actually creates a long chain of
> actions instead of tying the knot.
can you explain it d
Hello Bertram,
Sunday, April 18, 2010, 3:36:31 AM, you wrote:
> This expands as
> always a = a >> always a
> = a >> a >> always a
> = a >> a >> a >> always a
> ...
> where each >> application is represented by a newly allocated object
> (or several, I ha
Hello Leon,
Saturday, April 24, 2010, 12:23:58 AM, you wrote:
> file nearly a third smaller. Given that many modern variants of the
> "tar" command support .tar.lzma files directly
isn't latest version of lzma-based compression use .xz extension?
--
Best regards,
Bulat
Hello Stephen,
Thursday, April 29, 2010, 3:45:50 PM, you wrote:
license: custom or so. but future imaginary tools that automatically
checks license of entire library chain will fail
> Hello all
> How do I mark a Cabal package as containing a BSD3 library and an LGPL
> executable?
> I'm using
Hello Aran,
Friday, April 30, 2010, 2:26:20 AM, you wrote:
> In GHC, if a thread spawned by forkIO blocks on some network or
> disk IO, is the threading system smart enough not to wake the thread
afaik, yes. it's controlled by special i/o thread that multiplexes all
i/o done via stdlibs. but ghc
Hello Richard,
Saturday, May 1, 2010, 1:34:19 PM, you wrote:
> If libraries foo and bar are compiled using the same version of GHC, is
> is possible to link the two libraries into the same executable? Does
at the last end, you can put each entire library plus ghc runtime into dll
--
Best reg
Hello minh,
Tuesday, May 4, 2010, 11:15:03 AM, you wrote:
> Numerous games include for instance a complete Lua interpreter,
that's just one 100 kb dll :)
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
___
Haske
Hello Ivan,
Wednesday, May 5, 2010, 4:43:48 PM, you wrote:
>> How do you embed Lua in Haskell?
> http://hackage.haskell.org/package/hslua
tutorial: http://haskell.org/haskellwiki/HsLua
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
Hello Julian,
Friday, May 14, 2010, 4:18:42 PM, you wrote:
> Now, if I type
>> 3 + 4
> it does not work, and i really don't understand why. If i ask GHCi
> for 3's type ($ :t 3) it will answer "3 :: (Prelude.Num t) => t".
> But, if 3 and 4 are Prelude.Nums and there is an instanfe Num x x x
> for
Hello Don,
Friday, May 14, 2010, 9:43:38 PM, you wrote:
> Most .NET libraries are imperative, use mutable state -- so binding to
they are also OOP. ocaml supports OOP while haskell doesn't
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
___
Hello Limestraël,
Saturday, May 15, 2010, 7:02:38 PM, you wrote:
> But when I set my beat to tick every 60 times per second, the
> position is well updated, but I clearly see that the display
> dramatically slows down after a few seconds of execution. Too heavy rate for
> integrate?
it may be
Hello David,
Sunday, May 16, 2010, 7:18:29 PM, you wrote:
> "executeFile" is failing for me on Mac OS X 10.5.8, with ghc 6.12.1
> when compiling with "-threaded". Compiling without -threaded, or running on
> linux is fine.
>> forkProcess $ executeFile "/bin/echo" False ["Ok"] Nothing
afair,
Hello Daniel,
Friday, May 21, 2010, 11:55:35 PM, you wrote:
> xf = (fromRational $ toRational xd) :: Float
> xf = double2Float xd
> am still surprised how often such kinds of unobvious problems occur
> while programming in Haskell
does it mean that all other languages you are used doesn't have
Hello Andy,
Thursday, May 27, 2010, 5:45:27 PM, you wrote:
does it work both on linux and windows? i'm very interested to run
executables of both kinds and look what features are really supported
(i write file/archive manager and it seems that you have solved many
problems that drive me crazy, su
Hello Andy,
Friday, May 28, 2010, 1:05:59 AM, you wrote:
> Looks my file-manager:
> http://farm5.static.flickr.com/4027/4584389024_782b1e09ee_o.png
can you please share windows and linux executables and source code?
> I have finish all necessary GIO APIs at
> http://patch-tag.com/r/AndyStewart/
Hello Bulat,
Friday, May 28, 2010, 9:24:02 AM, you wrote:
>> I have finish all necessary GIO APIs at
>> http://patch-tag.com/r/AndyStewart/gio-branch/home
> but what is the license?
heh, i've found COPYING file. but what you mean? if it's just about
"one should share all improvements to the lib
Hello David,
Tuesday, June 8, 2010, 10:33:51 AM, you wrote:
> ( my guess is USE_REPORT_PRELUDE compiles functions as defined in
> the haskell report, but the other version is faster and used by default. )
you are right
--
Best regards,
Bulatmailto:bulat.zigans...
Hello Christopher,
Friday, June 11, 2010, 4:06:05 PM, you wrote:
> do if x
> then return ()
> else do bar; continueComputation
i format it this way:
if x then return () else do
bar
continueComputation
--
Best regards,
Bulatmailto:bulat.zigans...@gmai
Hello Christopher,
Friday, June 11, 2010, 4:35:00 PM, you wrote:
> if xthen foo
> else if y then bar
> else if z then mu
> else zot
case () of
_ | x -> foo
| y -> bar
| otherwise -> zor
it's usually considered as "haskell way" of doing this
--
Best regards,
Bulat
Hello Emmanuel,
Tuesday, June 15, 2010, 2:10:09 AM, you wrote:
> [f(a),f(b),f(c)] = g([a,b,c])
it looks a bit like vectorisation transformation in compilers
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
___
Has
Hello Leonel,
Friday, June 18, 2010, 6:46:31 AM, you wrote:
> to be used. Look at the new 10.000 colones bill:
and this one - http://www.bccr.fi.cr/WebPages/PaginaInicio/NuevaFamilia/5.html
is for C++ programmers :)
--
Best regards,
Bulatmailto:bulat.zigans...@gma
Hello Martin,
Thursday, June 17, 2010, 11:02:31 PM, you wrote:
> But what if I want to apply a list of functions to a single argument. I can
one more answer is "swing map":
http://www.haskell.org/haskellwiki/Pointfree#Swing
--
Best regards,
Bulatmailto:bulat.zig
Hello ajb,
Wednesday, June 23, 2010, 6:58:30 AM, you wrote:
> build ((w1,t1):(w2,t2):wts)
>= build $ insertBy (comparing fst) (w1+w2, Node t1 t2) wts
this algo is O(n^2). to be O(n) you should handle separate lists of
leafs and nodes, adding new nodes to the tail of second list
--
Hello Felipe,
Thursday, June 24, 2010, 5:00:55 AM, you wrote:
>> Is that something that MonadFix is meant to be used for?
> In current Gtk libraries, no. You'll do something like
> However, if some library required you to supply the action while
> constructing the button, then I guess the answe
Hello Gábor,
Saturday, June 26, 2010, 4:29:28 PM, you wrote:
> It's interesting how C++ is imperative at the term level and
> functional at the type level
or logic? it supports indeterminate choice
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
__
Hello Felipe,
Saturday, June 26, 2010, 4:44:20 PM, you wrote:
> Even if we said "we don't care", we at least should change
> FilePath to be [Word8], and not [String]. Currently filepaths
> are silently "truncated" if any codepoint is beyond 255.
and there is no OS except Unix ;)
--
Best rega
Hello Felipe,
Saturday, June 26, 2010, 4:54:16 PM, you wrote:
>> > Even if we said "we don't care", we at least should change
>> > FilePath to be [Word8], and not [String]. Currently filepaths
> other OSs worked fine, should I use this API (i.e. type FilePath
> = String) to its fullest extent,
Hello Roman,
Sunday, June 27, 2010, 3:52:54 AM, you wrote:
> I fail to see how it will brake programs. Current programs do not use
> Unicode because it is implemented incorrectly.
i use it. current Linux implementation treats String as sequence of
bytes, and with manual recoding it allows to use
Hello Roman,
Sunday, June 27, 2010, 11:07:47 AM, you wrote:
>> Currently, FilePath is an alias for String. Changing FilePath to a real
>> type
> Just do not change FilePath, what may be simpler?
if FilePath will become abstract type, it will break all programs
that use it since they use it as S
Hello Roman,
Sunday, June 27, 2010, 11:11:59 AM, you wrote:
> No! The target encoding is the current locale. It is a no-brainer to
not necessarily. current locale, encoding of current terminal and
encoding of every filesystem mounted are all different things
--
Best regards,
Bulat
Hello Roman,
Sunday, June 27, 2010, 11:24:16 AM, you wrote:
> O'kay, but IMHO few people want to have a headache with recoding. You
> knew that the implementation was incorrect, why you relied on it?
what is alternative? :) on windows i've used low-level open()-styly
APIs, on Linux i got the sa
Hello Roman,
Sunday, June 27, 2010, 11:28:49 AM, you wrote:
>>> Just do not change FilePath, what may be simpler?
>> if FilePath will become abstract type, it will break all programs
>> that use it since they use it as String
> Hello, do you read me? I said: "do not change FilePath".
what you mea
Hello Roman,
Sunday, June 27, 2010, 11:37:24 AM, you wrote:
>>> No! The target encoding is the current locale. It is a no-brainer to
>> not necessarily. current locale, encoding of current terminal and
>> encoding of every filesystem mounted are all different things
> And we should stick to the c
Hello Peter,
Thursday, April 16, 2009, 12:29:41 PM, you wrote:
Lennart (and Patai) said about unsafePerformIO, you - about NOINLINE
> Well, the documentation says:
> Use {-# NOINLINE foo #-} as a pragma on any function foo that calls
> unsafePerformIO. If the call is inlined, the I/O may be perf
Hello michael,
Friday, April 17, 2009, 6:26:33 PM, you wrote:
http://haskell.org/cabal/
> You're right. Since I'm not familiar with Cabal, I didn't use it. Is there a
> good tutorial? Docs?
> Also, I'm running a 32-bit Linux OS. Does one get a significant speed
> increase by
> switching to a
Hello Jason,
Saturday, April 18, 2009, 1:41:18 AM, you wrote:
> The algorithm should return the same result as:
> sortProduct a b = sort [ x * y | x <- a, y <- b ]
i think it's well-known problem. you should write a function merging
infinite list of sorted lists. in assumption that lists are ord
Hello michael,
Saturday, April 18, 2009, 6:56:20 PM, you wrote:
> Is there a general function to count list elements. I'm trying this
you should add Eq restriction to type declaration since "==" operation
belomngs to Eq class and your function may work only with types
supporting comparision:
co
Hello michael,
Saturday, April 18, 2009, 8:27:45 PM, you wrote:
so you can use Scheme to derive theorem proofs. useful for exams! :)
> I know functions can be compared in Scheme
> Welcome to DrScheme, version 4.1 [3m].
> Language: Swindle; memory limit: 128 megabytes.
>> (equal? equal? equal?)
Hello R.A.,
Sunday, April 19, 2009, 11:46:53 PM, you wrote:
> Does anybody know if there are any plans to incorporate some of
> these extensions into GHC - specifically the existential typing ?
it is already here, but you should use "forall" keyword instead odf
"exists"
--
Best regards,
Bula
Hello Jon,
Monday, April 20, 2009, 1:59:07 PM, you wrote:
> It's not an implementor's place to make such decisions --
> they can legitimately say "this feature sucks" and tell the
> next Haskell committee so. If they care enough about it,
> they can lobby or get on that next committee, but the
>
Hello michael,
Monday, April 20, 2009, 6:32:47 PM, you wrote:
something like
0*_ = 0
x*y = x *# y
or vice versa
_*0 = 0
x*y = x *# y
where *# is original (*) definition. current ghc definiton just
performs cpu-level operation w/o checking for 0 since this is rarely
useful and need some time
Hello S.,
Tuesday, April 21, 2009, 5:42:15 PM, you wrote:
> If we had been interested in raising fierce discussions about n+k
> patterns or how and where cabal installs things, we could have easily
> achieved the same effect with much less effort.
you mean that we should shoot up? :)
--
Best
Hello Jason,
Wednesday, April 22, 2009, 1:14:49 PM, you wrote:
there is no any need in unsafePerformIO for array computations - ST
monad is exactly what one need here
> If you want to do raw IO and repackage it as "pure", you can
> use `unsafePerformIO` and friends. It is important to use th
Hello Jon,
Wednesday, April 22, 2009, 1:54:58 PM, you wrote:
> Does anyone have any comments on the following criticism of some difficulties
> with FFI, including IO, in Haskell:
> http://groups.google.com/group/comp.lang.functional/msg/6d650c086b2c8a49?hl=en
> In particular, is it not always p
Hello Magnus,
Thursday, April 23, 2009, 8:47:23 PM, you wrote:
base is built-in into ghc/hugs/...
it never can be on hackage
> I'm not sure why building of my recently uploaded version of dataenc
> fails to build on Hackage[1]. Where can I find out what version of base
> is available on Hackage
Hello Sam,
Friday, April 24, 2009, 8:36:50 PM, you wrote:
> I work in Games middleware, and am very interested in looking at how
> Haskell could help us. We basically sell C++ libraries. I would like to
> be able to write some areas of our libraries in Haskell, compile the
> Haskell to C and inco
Hello Alex,
Friday, April 24, 2009, 8:57:40 PM, you wrote:
>> so, if you just need haskell-C++ interaction, you may look into using
>> FFI [1,2]. if you believe that you can compile some
>> java/ruby/haskellwhatever code down to C++ and incorporate it into
>> your function - sorry, they all h
;t see that this would be unachievable, particularly given it's
> generating C already. Have I missed something?
> Cheers,
> Sam
> -Original Message-
> From: Bulat Ziganshin [mailto:bulat.zigans...@gmail.com]
> Sent: 24 April 2009 17:53
> To: Sam Martin
> Cc: h
er a dozen compilers in
> multiple languages, and my search ended with Timber. As I mentioned,
> it is very young, it has very little standard library to speak of, but it has
> strong possibilities.
>
> On Fri, Apr 24, 2009 at 1:34 PM, Bulat Ziganshin
> wrote:
>
Hello Sam,
Saturday, April 25, 2009, 11:40:05 PM, you wrote:
btw, are you seen MetaLua? it's pretty piece of software that makes
Lua very FPish
>
>
> Hi Ryan,
>
> Nice to hear from another games industry coder on the Haskell lists :)
>
> Thanks, this is exactly the kind of detail I
Hello Maurício,
Wednesday, April 29, 2009, 11:09:04 PM, you wrote:
> My goal is to have a place where one can find reliable and
> comprehensive low-level bindings to foreign libraries, so that
> writing higher level bindings becomes an easier task.
it looks impractical. better will be to provide
Hello Sven,
Saturday, May 2, 2009, 9:14:13 PM, you wrote:
> must, but the actual packaging is not nice. So the obvious idea is to
> introduce 3 new packages which lift out functionality from the OpenGL package:
another possible variant: OpenGL-DataTypes package that joins these 3
--
Best rega
Hello Nicolas,
Saturday, May 2, 2009, 9:17:55 PM, you wrote:
> But now I don't know how to dynamically add new spells (new spells can be
> created in my gameplay). Since I can't assign a new value to the `spells'
> variable (Data.Map.insert returns a new map), I just don't know where to
> go.
we
Hello Daniel,
Sunday, May 3, 2009, 10:24:52 PM, you wrote:
> 32-bit sing core [1]: Lisp, Fortran
:) this test measures speed of some programs, not "languages".
results are depends mainly on bundled libraries and RTS. by no means
it demonstrates speed of compiler-generated code of carefully-writ
Hello Krzysztof,
Sunday, May 3, 2009, 10:06:30 PM, you wrote:
> This roughly characterizes C++ vector<> class. I'm ready to implement
http://haskell.org/haskellwiki/Library/ArrayRef#Using_dynamic_.28resizable.29_arrays
although this (mine) package is probably incompatible with current ghc
versi
Hello Gwern,
Sunday, May 3, 2009, 10:29:37 PM, you wrote:
>> 32-bit quad-core [2]: Haskell, C# Mono, Lisp, Clean, Fortran.
> I can't really read Clean, but it certainly looks as if it's making no
> use of concurrency at all, while the Haskell one most certainly is.
probably other languages goes
Hello Daniel,
Sunday, May 3, 2009, 10:42:06 PM, you wrote:
> I'm not sure about the second comment. I haven't seen the Haskell site
> mention the shootout
just search cafe archives ;)
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
Hello Paolo,
Monday, May 4, 2009, 2:05:44 PM, you wrote:
> Martin Odersky advocates the OO features of the scala language
> proposing an interesting problem where the OO approach seams
> valuable.
i know two problems in Haskell/GHC that require OO-loke features -
extensible exceptions and GUI wi
Hello Mads,
Monday, May 4, 2009, 7:01:16 PM, you wrote:
>> i know two problems in Haskell/GHC that require OO-loke features -
>> extensible exceptions and GUI widget types hierarchy
> Yes, type hierarchies require OO.
> But, do we really need to represent different widget-types in a
> hierarchy
Hello z_axis,
Tuesday, May 5, 2009, 1:27:16 PM, you wrote:
> floatLocation :: Window -> X (ScreenId, W.RationalRect)
>
> rr <- snd `fmap` floatLocation w
>
> class Functor f where fmap :: (a -> b) -> f a -> f b
looks ok. X===f, fmap executes
floatLocation w :: X (ScreenId, W.RationalRect) ===
Hello applebiz89,
Tuesday, May 5, 2009, 7:20:35 PM, you wrote:
> filmsInGivenYear :: Int -> [Film] -> [String]
> filmsInGivenYear filmYear ?= [ title | year <- (Film title director year
> fans) , year == filmYear] (this code wont compile - error given '?Syntax
> error in expression (unexpected `;
Hello Wolfgang,
Tuesday, May 5, 2009, 8:27:17 PM, you wrote:
>> i know two problems in Haskell/GHC that require OO-loke features -
>> extensible exceptions and GUI widget types hierarchy
> Note that you don’t need different types for different kinds of GUI widgets if
> you use Functional Reactiv
Hello FFT,
Wednesday, May 6, 2009, 11:59:53 PM, you wrote:
> I've heard it's hard to contain a long-running Haskell application in
> a finite amount of memory
not exactly. you may alloc fixed pool of memory to application (say, 1gb)
if you know that it never need more memory. but as far as you d
Hello applebiz89,
Thursday, May 7, 2009, 1:46:34 PM, you wrote:
> main :: IO()
you may find http://haskell.org/haskellwiki/IO_inside interesting
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
___
Haskell-Cafe ma
Hello Simon,
Thursday, May 7, 2009, 2:04:05 PM, you wrote:
>>> I've heard it's hard to contain a long-running Haskell application in
>>> a finite amount of memory
>>
>> not exactly. you may alloc fixed pool of memory to application (say, 1gb)
>> if you know that it never need more memory. but as
Hello Simon,
Thursday, May 7, 2009, 5:45:53 PM, you wrote:
> out of date and say 256k, I've just fixed that). The old generation is
> allowed to grow to 2x its previous size by default before being
> collected.
you are right. i just checked old logs - seems that previously i just
misinterprete
Hello Simon,
Thursday, May 7, 2009, 6:58:02 PM, you wrote:
>> and completely separate topic - +RTS -s report description also
>> doesn't exist
> Scroll down in that section I linked to before:
> http://www.haskell.org/ghc/docs/latest/html/users_guide/runtime-control.html#rts-options-gc
you are
Hello Itsme,
Thursday, May 7, 2009, 9:18:47 PM, you wrote:
> I could not find any contact info for Brian O'Sullivan, Don Stewart, or John
> Goerzen on their book site. Any pointers to how I might locate any of them
> much appreciated.
they are highly secret Haskell agents sent from 21xx. we are
Hello Jason,
Thursday, May 7, 2009, 9:06:33 PM, you wrote:
>> you are right again. so, that remains: you shouldn't suppose that
>> user have read 90's GC paper. give a short excerpt of it: how
>> generational GC works and how memory usage converts to memory
>> footprint. then descriptions of RTS
Hello Ketil,
Friday, May 8, 2009, 10:49:23 AM, you wrote:
>> FWIW, the JVM also fails to release memory resources back to the
>> OS. Given all the problems I've seen that one cause for long-running
>> processes, I'm definitely in support of correcting any behavior like
>> this in the GHC RTS.
>
Hello Peter,
Sunday, May 10, 2009, 7:43:38 PM, you wrote:
> I'd like to announce the release of Gtk2HS 0.10.1! This release
> includes mostly bug fixes and other small improvements. Most notably,
> GHC 6.10.1 is now supported.
6.10.2/6.10.3?
--
Best regards,
Bulat
Hello Peter,
Monday, May 11, 2009, 5:40:20 PM, you wrote:
>>> GHC 6.10.1 is now supported.
>>
>> 6.10.2/6.10.3?
> Yes, those versions are supported as well. GHC 6.10.1 changed the way
> finalizers are handled, and as a result, Gtk2HS programs were
> crashing. I don't think anything that affects
Hello Daryoush,
Wednesday, May 13, 2009, 6:11:10 AM, you wrote:
> runST :: (forall s. ST s a) -> a
> evalStateT :: Monad m => StateT s m a -> s -> m a
these are quite opposite things. later means that you should pass some
value of Monad class (well, in this case it's StateT value whose type
is
Hello Duncan,
Wednesday, May 13, 2009, 3:33:13 PM, you wrote:
> I think it should remain deprecated and we should work on the
> replacement so that TH can switch its dependency.
TH isn't high-performance package and i think that it should just
switch to use of String
--
Best regards,
Bulat
Hello Robin,
Wednesday, May 13, 2009, 3:45:57 PM, you wrote:
>> TH isn't high-performance package and i think that it should just
>> switch to use of String
> I don't agree. TH can sometimes slow down a build considerably. I don't
> want to see it getting even slower.
i think GHC compile times
Hello Belka,
Saturday, May 16, 2009, 9:22:54 PM, you wrote:
> I'm trying to learn Haskell typeclasses, - about how to use them, - but
am i correctly understood that you've started learning type classes
with multi-parameter ones? this may be a bit too brave, especially for
a woman :D
i suggest y
Hello David,
Wednesday, May 27, 2009, 7:20:33 PM, you wrote:
> Interesting:
> http://www.facebook.com/careers/puzzles.php
> So they use Haskell at Facebook?
actually, of 5 compiled languages there, 3 are FP, and only 2
remaining are the most popular languages on planet - C++ and Java
so this l
Hello Simon,
Wednesday, May 27, 2009, 11:42:22 PM, you wrote:
while we are here - i always had problems understanding what is
inferred and what is expected type. may be problem is just that i'm
not native speaker
are other, especially beginners, had the same problem?
> Claus made a suggestion a
Hello 张旭,
Wednesday, May 27, 2009, 11:51:34 PM, you wrote:
> Hi, I am really new to haskell. I am reading "A gentle instruction
> to haskell" now. And I just cannot understand the chapter below. Is
> there anybody who can gives me some hints about why the pattern
> matching for "client" is so ear
Hello Max,
Thursday, May 28, 2009, 12:14:50 AM, you wrote:
> As to whether it's confusing, I sometimes have to read these messages
> a few times (sometimes it's unclear which expression is being referred
> to, or why GHC thinks that the expression has a certain type), but the
> words themselves a
Hello Max,
Thursday, May 28, 2009, 12:49:20 AM, you wrote:
> I don't remember having any trouble, but that was a few years ago, and
> type errors are confusing generally. I think that the main difficulty
> with type errors is not the error *messages*, but I'm sure there is
> room for improvement.
Hello Max,
Thursday, May 28, 2009, 1:30:28 AM, you wrote:
> I prefer this wording:
> The inferred type of `True' is `Bool',
> while the type of the first argument of `f' should be `Int'.
> In the expression: f True
yes, it's also self-explanatory
> I prefer all three to Hugs's
> ERROR - Type
Hello Achim,
Thursday, May 28, 2009, 1:34:55 AM, you wrote:
>> Error: type of x is Integer
>> while type of read argument should be String
>>
> The problem with this is that the compiler can't know whether or not
> the type of arguments to read should be a String, as someone could
> have messed
1 - 100 of 2148 matches
Mail list logo
