Hello Jason,
Wednesday, December 1, 2010, 8:54:58 PM, you wrote:
I'm using ghc7 here. If I run your program with -O2, it takes 1943 MB of
memory max.
If I comment out everything except g then with -O2 it takes 1521 MB.
I'm not sure where the extra 400 MB of memory are going.
i think,
Hello Bruno,
Sunday, November 21, 2010, 8:49:52 AM, you wrote:
ghc --make ftest2.hs
may be your versions of ghc and (win)ghci are different? the behavior
was changed in latest versions afaik
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
Hello Gregg,
Tuesday, November 9, 2010, 2:12:12 AM, you wrote:
Doesn't COBOL have significant layout anyway as an inspiration to
both?
Yes and no. What it actually has relates strongly to punched cards
and is more like assemblers of the day.
i never programmed in COBOL, but afaik
Hello Mitar,
Friday, November 5, 2010, 12:45:21 PM, you wrote:
from - newChan
for - newChan
let nerve = Nerve (Axon from) (AxonAny for)
create = do from - newChan
for - newChan
return$ Nerve (Axon from) (AxonAny for)
main = do nerve - create
...
--
Best
Hello Mitar,
Friday, November 5, 2010, 2:08:52 PM, you wrote:
I would like to call it like create (Axon undefined) (AxonAny
undefined) and get in that case Nerve (Axon a) (AxonAny b) as a
result. If I would call it like create (AxonAny undefined) (AxonAny
undefined) I would get Nerve
Hello haskell,
people, are you know haskell apps that has more than 50k downloads per
month (or more than 25k users) ?
--
Best regards,
Bulat mailto:bulat.zigans...@gmail.com
___
Haskell-Cafe mailing list
Hello Ivan,
Saturday, November 6, 2010, 4:05:38 AM, you wrote:
Possible candidates:
* GHC
* XMonad
* Darcs
for me, darcs and ghc are programmer's instruments. xmonad is real
application, having some utility outside of programmers community.
i'm looking for utility of haskell for real world.
Hello Permjacov,
Tuesday, November 2, 2010, 9:04:00 AM, you wrote:
Let us think, that we need some scripting language for our pure haskell
project and configure-compile-run is not a way. In such a case a
reasonably simple, yet standartized and wide known language should be
implemented. What
Hello aditya,
Sunday, October 24, 2010, 8:05:55 AM, you wrote:
HsLua page is nothing more but my fantasy about future HsLua
development :) you may find even XXX type where i don't found good
name :)
Hi all,
The HsLua page [1] says that Int,Double,String,Bool,[a] and [(a,b)]
types can be
Hello Claude,
Saturday, October 23, 2010, 11:57:23 PM, you wrote:
Is that true? The last time we discussed this in Haskell Cafe the
conclusion I drew from the discussion was that unsafe foreign functions
block the current thread but not any other thread.
The conclusion I drew was that
Hello John,
Monday, October 18, 2010, 8:15:42 PM, you wrote:
If anyone is listening, I would very much like for there to be a
mechanism by which external functions can be called unsafe-ly, but
without blocking all other Haskell threads. I have code that does this:
+RTS -N2
--
Best
Hello Leskó,
Friday, October 22, 2010, 1:50:54 AM, you wrote:
I run into a problem with readProcessWithExitCode (from System.Process
module). Basically what i want is to start an exe file, giving it some
input on stdin and receiving the results on stdout. But id the stdin and
look for other
Hello Ketil,
Monday, October 4, 2010, 11:30:48 AM, you wrote:
Prelude (if then Haskell else Cafe) False
lambda-if is easily implemented in terms of usual functions.
and we even have one named bool:
bool: Bool - a - a - a
lambda-case cannot be implemented as a function since we need
matching
Hello John,
Monday, October 4, 2010, 7:57:13 AM, you wrote:
Sure it does; a 32-bit system can address much more than 2**30
elements. Artificially limiting how much memory can be allocated by
depending on a poorly-specced type like 'Int' is a poor design
decision in Haskell and GHC.
are you
Hello C,
Sunday, October 3, 2010, 6:59:25 PM, you wrote:
Thanks Neil,
main = do
want [file1]
file1 * \x - do
need [file2]
putStrLn Hello
putStrLn World
What if I want to mention file1 only once?
mention_only_once file action = do
want [file]
file * action
main =
Hello Henry,
Sunday, October 3, 2010, 7:54:49 PM, you wrote:
It looks like array ranges can only be Ints, and not Int64 or Word64 types.
yes, it's Int internally got efficiency reasons. you can do your own
implementation to override this limit :)
--
Best regards,
Bulat
Hello Heinrich,
Saturday, October 2, 2010, 1:36:48 PM, you wrote:
Would you put a flattr button [1] on the wxHaskell page? This way,
people like me would be able to show their appreciation by donating a
this page doesn't describe how to pay and how to got the money
received. if Jeremy lives
Hello caseyh,
Monday, September 27, 2010, 9:55:14 PM, you wrote:
Why can't libraries/frameworks like wxHaskell/gtk2hs/... be used with
newer versions of ghc/wxWidgets/GTK+/... ?
because you don't compile from source code. ghc does massive inlining
so parts of old ghc libraries are compiled
Hello Johannes,
Friday, September 10, 2010, 2:25:58 PM, you wrote:
just forkIO in threaded RTS works for me. try:
main = do forkIO expensiveCalc
forkIO expensiveCalc
forkIO expensiveCalc
expensiveCalc
What's the story with FFI calls and concurrency?
I have an
Hello Wanas,
Friday, September 10, 2010, 12:55:14 AM, you wrote:
a) I want to write a function that generates lists of lists of
size $n$. All having the property that sum lst = sum [1..n].
a-1) After that, I want to remove all permutations. My idea of
you have very interesting questions.
Hello Brandon,
Tuesday, September 7, 2010, 8:37:32 PM, you wrote:
I'd call this incomplete because programs compiled with RTS options enabled
are still insecure.
The correct fix is to ignore GHCRTS and die on +RTS *when setuid*. Since
i strongly agree
--
Best regards,
Bulat
Hello Johannes,
Monday, September 6, 2010, 2:23:35 PM, you wrote:
i had such idea several years ago and proposed to name class ListLike.
this class was finally implemented by John Goerzen and it does
everything we can w/o changing language
the main thing about literals is that they need to be
Hello Stefan,
Monday, September 6, 2010, 3:47:11 PM, you wrote:
In general, it is kind of unfortunate that type classes and type
constructors share a namespace, even though there is no way to ever mix them
up.
btw, i also had proposal to automatically convert typeclasses used in
type
Hello Johannes,
Monday, September 6, 2010, 2:23:35 PM, you wrote:
so how about using list syntax ( [], : )
for anything list-like (e.g., Data.Sequence)?
i'vwe found my own proposal of such type:
http://www.mail-archive.com/haskell-cafe@haskell.org/msg15656.html
--
Best regards,
Bulat
Hello Serguey,
Monday, September 6, 2010, 7:57:46 PM, you wrote:
http://www.mail-archive.com/haskell-cafe@haskell.org/msg15656.html
Will Data.Map with its' empty, insert, findMin, etc, methods conform
to your proposed type?
but Data.Map isn't sequential container. instead, it maps arbitrary
Hello Serguey,
Monday, September 6, 2010, 8:16:03 PM, you wrote:
Basically, you - and others, - propose to add another class isomorphic
to already present lists. I think, most benefits of that class can be
achieved by using list conversion and RULE pragma.
what i propose should allow to
Hello michael,
Monday, September 6, 2010, 9:00:32 PM, you wrote:
Is there a handy list of operators and their precedence somewhere?
unlike most languages, operators are user-definable in haskell. so
there is no comprehensive list
any function with two arguments van be used as operator:
a
Hello michael,
Tuesday, August 31, 2010, 9:27:17 PM, you wrote:
f :: Int - Int
i.e. it's used when you define function types
So it's a type constructor, not a type? Could you please provide a simple
example of its usage?
Michael
--- On Tue, 8/31/10, Vo Minh Thu not...@gmail.com wrote:
Hello Permjacov,
Tuesday, August 31, 2010, 10:07:38 PM, you wrote:
what operations should be in arrow transformer class?
oh, these Russians :)
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
___
Haskell-Cafe
Hello Johan,
Tuesday, August 17, 2010, 12:20:37 PM, you wrote:
I agree, Data.Text is great. Unfortunately, its internal use of UTF-16
makes it inefficient for many purposes.
It's not clear to me that using UTF-16 internally does make
Data.Text noticeably slower.
not slower but require
Hello Johan,
Tuesday, August 17, 2010, 1:06:30 PM, you wrote:
So it's not clear to me that using UTF-16 makes the program
noticeably slower or use more memory on a real program.
it's clear misunderstanding. of course, not every program holds much
text data in memory. but some does, and here
Hello Tako,
Tuesday, August 17, 2010, 12:46:35 PM, you wrote:
not slower but require 2x more memory. speed is the same since
Unicode contains 2^20 codepoints
This is not entirely correct because it all depends on your data.
of course i mean ascii chars
--
Best regards,
Bulat
Hello Hemanth,
Tuesday, August 17, 2010, 2:05:44 PM, you wrote:
btw, i've written unfinished hslua tutorial:
http://haskell.org/haskellwiki/HsLua
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
___
Haskell-Cafe
Hello Tom,
Tuesday, August 17, 2010, 2:09:09 PM, you wrote:
In the first iteration of the Text package, UTF-16 was chosen because
it had a nice balance of arithmetic overhead and space. The
arithmetic for UTF-8 started to have serious performance impacts in
situations where the entire
Hello Tako,
Tuesday, August 17, 2010, 3:03:20 PM, you wrote:
Unless a Char in Haskell is 32 bits (or at least more than 16 bits)
it con NOT encode all Unicode points.
it's 32 bit
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
Hello Tillmann,
Sunday, August 15, 2010, 7:40:54 PM, you wrote:
But in a world passing interpretation of IO, print is supposed to be a
pure Haskell function. So the value world2 can only depend on the values
of print and world1, but not on the actions of some concurrent thread.
the whole
Hello Bryan,
Sunday, August 15, 2010, 10:04:01 PM, you wrote:
shared on Friday, and boiled it down to a simple test case: how long does it
take to read a 31MB file?
GNU wc -m:
there are even slower ways to do it if you need :)
if your data aren't cached, then speed is limited by HDD. if
Hello Daniel,
Sunday, August 15, 2010, 10:39:24 PM, you wrote:
That's great. If that performance difference is a show stopper, one
shouldn't go higher-level than C anyway :)
*all* speed measurements that find Haskell is as fast as C, was
broken. Let's see:
D:\testingread MsOffice.arc
Hello Henk-Jan,
Friday, August 13, 2010, 2:23:58 PM, you wrote:
You can do this with the flag -optl-mwindows; this passes the flag
-mwindows to the linker. Because this is a linker option, you cannot find
it in the GHC documentation. This solution also works for other GUIs, like
wxHaskell.
Hello michael,
Saturday, August 14, 2010, 5:38:46 AM, you wrote:
The program below takes a text file and unwraps all lines to 72
columns, but I'm getting an end of file message at the top of my output.
How do I lose the EOF?
use isEOF function. even better, use interact
--
Best regards,
Hello michael,
Sunday, August 8, 2010, 5:36:05 PM, you wrote:
i highly recommend you to read
http://sigfpe.blogspot.com/2006/08/you-could-have-invented-monads-and.html
that is the best introduction into monads i know
and then http://haskell.org/all_about_monads/html/index.html
- comprehensive
Hello Jake,
Friday, July 16, 2010, 7:26:22 AM, you wrote:
Excluding DiffArray under certain usage patterns of course, but
DiffArray is slow for unknown reasons besides algorithmic complexity.
unknown reason = MVar usage
ArrayRef library contains parameterized DiffArray implementation that
Hello Andrew,
Saturday, July 3, 2010, 1:57:22 PM, you wrote:
(I suppose I'm just bitter because any Haskell libraries involving C are
almost guaranteed to not work on Windows...)
haskell code is easily ported between OSes, unlike C one. when i
ported my application from Win to Linux, i spend
Hello Ivan,
Saturday, July 3, 2010, 3:24:34 PM, you wrote:
haskell code is easily ported between OSes, unlike C one. when i
ported my application from Win to Linux, i spend one day on haskell
code and 3 days on C one, despite the fact that haskell code dealed
with OS interaction and C used
Hello Ertugrul,
Saturday, July 3, 2010, 4:25:22 PM, you wrote:
This has proven very useful for me. My usual way is writing monad
transformers and sticking them together, often together with concurrent
programming.
... /what/ my code is
doing, because it's written in natural language as
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
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
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 mean by
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 current
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 regards,
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, my
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 answer
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 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,
Bulat
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,
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
___
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,
Bulat
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 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,
Bulat
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,
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
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 library
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, forkProcess
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 due
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 x of
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 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 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
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 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 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 have not looked at it
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
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 deeper?
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
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 run
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 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
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 to
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 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
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 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)
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, and
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
extra
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.
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 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 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
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,
Thursday, February 4, 2010, 6:49:05 PM, you wrote:
Can I set this in the source code itself too?
http://www.haskell.org/ghc/docs/latest/html/users_guide/flag-reference.html
says that this option is dynamic so afaik it should work
--
Best regards,
Bulat
Hello John,
Thursday, February 4, 2010, 11:51:59 PM, you wrote:
tl;dr: Lots of smart people, with a history of being right about this
sort of thing, say iteratees are better. Evidence suggests
iteratee-based IO is faster and more predictable than lazy IO.
Iteratees are really hard to
Hello Gunther,
Thursday, January 28, 2010, 4:07:07 PM, you wrote:
thanks for the tip, but how do I use the library?
I can't really make out how to feed it UTF-16 and get String (UTF-8) back.
Haskell String type isn't UTF-8 encoded. it's [Char] where Char is in
UCS-4 aka UTF-32 :)
BTW: I
Hello Johan,
Thursday, January 28, 2010, 4:20:48 PM, you wrote:
Haskell String type isn't UTF-8 encoded. it's [Char] where Char is in
UCS-4 aka UTF-32 :)
That's not quite correct. [Char] is a sequence of Unicode code
points, UTF-32 is one possible encoding of those code points. The
Hello Neil,
Tuesday, January 19, 2010, 10:15:15 PM, you wrote:
can you give a permission to translate
http://community.haskell.org/~ndm/darcs/uniplate/uniplate.htm
to Russian for http://fprog.ru/ online functional programming journal?
Yes, that sounds great. However, I'm currently not a
Hello Neil,
Monday, January 18, 2010, 10:56:00 PM, you wrote:
Uniplate might be the answer you are looking for -
http://community.haskell.org/~ndm/uniplate
it's brilliant! some people has the talent to discover complex things
and you have the talent to make complex things simple. it's first
Hello VoidPrayer,
Sunday, January 17, 2010, 5:32:55 PM, you wrote:
By the way, is it only valid when let only affects the one expression after
that? I read where vs let in the HaskellWiki but all the examples are let
... in.
the let inside do is just a syntax sugar:
do xxx
let yyy
zzz
1 - 100 of 1995 matches
Mail list logo
