Hello Paul,
Wednesday, August 8, 2007, 10:20:39 PM, you wrote:
> we need). On the other hand, if we give imperative programmers the
> tools to do all the things they are used to doing in C++, then we
> will be depriving them of the joys of programming in the Functional
> Way. How many times hav
Hello Hugh,
Thursday, August 9, 2007, 4:59:04 AM, you wrote:
> How easy is gtk to use from haskell by the way? In gc'd
> imperative languages, typically only one thread is allowed to
> communicate with the GUI, and you need to set up a whole bunch of
> message-parsing stuff to communicate with
Hello Thomas,
Thursday, August 9, 2007, 8:12:27 PM, you wrote:
> In the following code which uses template haskell, how can I get
> back the macro-expanded code generated from
citating http://www.haskell.org/bz/thdoc.htm :
In order to make debugging Template Haskell programs easier, compiler
su
Hello John,
Friday, August 10, 2007, 5:15:56 AM, you wrote:
> data Quad = BL | BR | TL | TR
> under jhc (and probably ghc at some point in the future) there is another
> very strong advantage to the second one, since it is an enumerated type,
> internally it can be represented by a simple unboxe
Hello Donald,
Friday, August 10, 2007, 10:46:36 AM, you wrote:
> Hmm. Not looking so good so for for the imperative, GC'd languages.
>
> Java?
>
> http://shootout.alioth.debian.org/gp4/benchmark.php?test=all&lang=ghc&lang2=java
> C#?
Donald, i have written (an not once) that most of shoou
Hello Michael,
Friday, August 10, 2007, 12:50:43 PM, you wrote:
> As for threading, in addition to Haskell's approach you might also
> look at Erlang, which has a quite
> different (and quite interesting) approach to the whole problem. I wonder if
> anyone has tried to
> implement a message-pa
Hello Andrew,
Friday, August 10, 2007, 9:37:31 PM, you wrote:
> Would be nice if it *could* somehow be parametric...
ForeignArray may hold any Storable values. look at
http://haskell.org/haskellwiki/Modern_array_libraries - we have no
less than 10 array constructors :))
--
Best regards,
Bula
Hello Brian,
Saturday, August 11, 2007, 8:35:49 PM, you wrote:
> The key idea of Cilk is that it's easier to deparallelize than it is to
> parallelize, especially automatically. So the idea is that the program is
> written incredibly parallel, with huge numbers of microthreads, which are
> (on a
Hello Gregory,
Sunday, August 12, 2007, 9:32:04 AM, you wrote:
>> I've been struggling with writing a parser that needs to parse include
>> files within source files.
Parsec can't accomplish with without using unsafePerformIO because
it's monad is pure. it's algorithmically impossible to have
Hello Stefan,
Tuesday, August 21, 2007, 10:08:59 AM, you wrote:
> Your code is broken in a most evil and insidious way.
and this code, too? :)
freezeSTUArray :: Ix i => STUArray s i e -> ST s (UArray i e)
freezeSTUArray (STUArray l u marr#) = ST $ \s1# ->
case sizeofMutableByteArray# marr#
Hello Ryan,
Tuesday, August 21, 2007, 10:47:06 AM, you wrote:
>> Your code is broken in a most evil and insidious way.
>
> Interesting. This is for a toy project, so I'm not too worried,
> but lets say I wanted to do this "correctly" and I was set on using
> IOUArray for some reason. (The Ha
Hello Xavier,
Thursday, August 23, 2007, 3:08:25 AM, you wrote:
> I am learning Haskell with "Programming in Haskell" (an excellent
> book BTW).
scheme of lazy evaluation called "graph reduction"
you may consider it as repetitive replacing right parts of function
definitions with their left p
Hello Isaac,
Thursday, August 23, 2007, 4:17:52 PM, you wrote:
> Using IORefs in two different threads probably needs MVars [1] or TVars
> no documentation where it should be:
the best documentation still is
"Tackling the awkward squad: monadic input/output, concurrency,
exceptions, and foreign
Hello Miguel,
Thursday, August 30, 2007, 9:40:08 AM, you wrote:
> What about running Haskell on a PostScript printer? PostScript IS
> Turing-complete.
it would be cool to port SOE graphics to PostScript engine :)
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
__
Hello Hugh,
Thursday, August 30, 2007, 11:01:02 AM, you wrote:
>> But it's not that simple...
> Few things are ;-) Whats the catch? Can we use a graphics-card as an
> n-core machine, where n >= 1024?
no. it's more like 8-16 cores with 64-element SSE instructions
http://developer.download.nvi
Hello Hugh,
Thursday, August 30, 2007, 2:46:51 PM, you wrote:
> - this technology works on GeGForce 8800 cards or better
afaik, on any 8xxx cards - the only difference is number of threads
> - 128 thread processor
it's the same as 8800GTX. please read CUDA manual first. these 128
threads are n
Hello Alexander,
Monday, September 3, 2007, 11:46:56 AM, you wrote:
> In Ocaml and Python a special function is used that takes
> a function and an arguments. For example:
> value caml_callback(value closure, value arg);
> PyObject* PyObject_CallObject(PyObject *func, PyObject *args)
both use
Hello Simon,
Wednesday, September 5, 2007, 11:19:28 AM, you wrote:
> when you come across a case where GHC produces an
> unhelpful message, send it in, along with the program
> that produced it,
i have put such tickets about year ago :) basically, it was about
just chang
Hello Simon,
Wednesday, September 5, 2007, 12:56:18 PM, you wrote:
> String is not an instance of class Foo -- single param
> No instance for (Bar String Int)-- multi-param
> Would that be better (single-param case is easier), or worse (inconsistent)?
easier - m
Hello Isaac,
Thursday, September 6, 2007, 9:41:34 PM, you wrote:
> Unboxing is, unfortunately, observable: it is not so easy to make a
> strict array of SomeArbitraryAlgebraicDataType, because it's not in
> class Storable.
parallel arrays in GHC is just about it
--
Best regards,
Bulat
Hello Andrew,
Saturday, September 8, 2007, 8:36:06 PM, you wrote:
> * Access the Windoze registry and play with COM stuff.
> * Get system-specific file information (protection bits, modification
> times, security information, etc.)
> * Query the OS. (How many CPUs? How much RAM? What is my IP ad
Hello Neil,
Monday, September 10, 2007, 3:49:06 AM, you wrote:
>> I'm sure it's true, but it's quite irrelevant to my question, which is
>> "why is using getChar so much slower than using getContents"?
> Buffering, blocks and locks.
in ghc, is entirely due to locking, which is the slowest opera
Hello ok,
Monday, September 10, 2007, 6:09:27 AM, you wrote:
>> Locks: getChar has to acquire locks, as does getContents. However,
>> because getContents can operate on blocks, this requires many fewer
>> locks.
> What's to lock against? I'm writing single-threaded code.
unfortunately, there is
Hello ok,
Monday, September 10, 2007, 7:03:34 AM, you wrote:
> (What's the best thing to read to explain functional dependencies for
> multi-parameter type classes?)
ghc 6.6+ docs. but
1) arrays don't use FDs
2) FDs are old technique. starting with ghc 6.8, ATs will be available
and should be u
Hello Sven,
Tuesday, September 11, 2007, 11:10:17 AM, you wrote:
> Haddock docs. The example above means something completely different, so I
> propose to add another class (e.g. "ExternalBinary", better name needed) to
this looks correct form theoretical POV but don't forget that then you
will
Hello Ronald,
Wednesday, September 12, 2007, 11:18:05 PM, you wrote:
> So, after more searching on the internet and some RTFM, I think I
> found my answer, and it seems to work, but I don't know if it's the
> right answer to generalize from.
i have added your recipe to http://www.haskell.org/has
Hello Stefan,
Thursday, September 13, 2007, 4:40:17 AM, you wrote:
> I'm pretty sure Hugs does the right thing. NHC is probably broken. In
> any case, we already have hGetBuf / hPutBuf in the standard base
> libaries for raw binary IO, so code that uses getChar for bytes really
> has no excuse.
Hello Simon,
Thursday, September 13, 2007, 2:12:18 PM, you wrote:
> http://www.haskell.org/haskellwiki/FFI_cook_book
> There's also a GHC page about the FFI here:
> http://haskell.org/haskellwiki/GHC/Using_the_FFI
this page, despite its name, is only about dealing with Visual C++ via
DL
tionary at the beginning of the file and use
> it to deserialize.
> I'm not sure this can be done on top of Binary since the type tag
> will determine the Binary instance to use.
> On Jul 11, 2006, at 7:38 AM, Bulat Ziganshin wrote:
>> Hello Haskell,
>>
Hello Donald,
Wednesday, July 12, 2006, 12:55:50 PM, you wrote:
> Question over whether it should be:
> splitBy (=='a') "aabbaca" == ["","","bb","c",""]
> or
> splitBy (=='a') "aabbaca" == ["bb","c"]
> I argue the second form is what people usually want.
1) at least for 'lines' people
Hello Henning,
Wednesday, July 12, 2006, 1:23:53 PM, you wrote:
> I would like to tell Cabal which modules are required and which are
> supported, or recommended, but not needed. I could split Haskore into
> several packages, but then again, installation of Haskore and its
> sub-packages becomes
Hello Jeremy,
Tuesday, July 11, 2006, 10:47:09 PM, you wrote:
>> what is a best way to bring C constant (defined in header file) into
>> the Haskell source?
> If this ^^^ was your entire question, I would say, use hsc2hs.
> http://haskell.org/ghc/docs/latest/html/users_guide/hsc2hs.html
>
Hello Simon,
Wednesday, July 12, 2006, 6:28:55 PM, you wrote:
>> like to be able to say the following: "Cabal, find and use package X
>> if it exists. Furthermore, when CPPing source code, set a #define
>> HAS_PACKAGE_X so I can do conditional compilation based on the (non-)
> I have some ch
Hello Donald,
Thursday, July 13, 2006, 9:33:34 AM, you wrote:
>> Why can't Haskell (with extensions) do type-level Peano naturals in
>> the same fashion? The code would be something like:
darcs get --partial --tag '0.1' http://www.eecs.tufts.edu/~rdocki01/typenats/
--
Best regards,
Bulat
Hello Jeremy,
Wednesday, July 12, 2006, 10:43:22 PM, you wrote:
>> I'm interested in attending the Hackathon, but I don't have any previous
>> experience working on compilers.
> Perhaps we should start a list of pre-session recommended reading on
> the wiki page? I would recommend at least skimm
Hello Simon,
Thursday, July 13, 2006, 1:40:22 PM, you wrote:
>>> I have some changes to Cabal partly finished that will address this.
>>> Don't worry, it's coming.
>>
>> thanks, i will be glad to see it. but it will be GHC66-only?
> No, just a new version of Cabal, which will work with 6.4.x.
Hello Tomasz,
Friday, July 14, 2006, 9:31:32 AM, you wrote:
>> There might be issues with tuples though, for example (1,2,) would be
>> the (,) tuple and not the (,,) tuple, which is a bit weird.
> Besides, it might be a bit more natural if (1,2,) was a shorthand for
(\x ->> (1,2,x))
in haskell
Hello Simon,
Friday, July 14, 2006, 7:21:26 PM, you wrote:
> The History of Haskell
how about naming it "Haskell: lazy programmer's language" ? :)
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
___
Haskell-Cafe
Hello gurus :)
i got message about problems compiling Streams 0.2.1 library on Unix systems:
- I include file io.h, but this particular system has "sys/io.h"
instead. I think that i should solve this problem by including
HsBase.h which should include proper io.h on any system supported.
One more
Hello Asfand,
Monday, July 17, 2006, 7:31:23 PM, you wrote:
> I finally got my spiffy dual-core processor (an Opteron 165 no-less)
> and want to learn STM, since I think it and haskell are the future of
> concurrent programming.
> How do I compile Haskell to be able learn STM on it, using "prope
Hello Eugene,
Monday, July 17, 2006, 6:41:26 PM, you wrote:
>> - I include file io.h, but this particular system has "sys/io.h"
>> instead.
> Just out of the blue: could it be that you rather need ?
> It's the place where open() and friends are defined. Maybe(?) windows
> have them in ...
the o
Hello Duncan,
Monday, July 17, 2006, 6:18:49 PM, you wrote:
>> - I include file io.h, but this particular system has "sys/io.h"
> Are you sure you need sys/io.h? What are you using from it? As far as I
> can see it doesn't define anything that you might want to use, just
> functions for reading
Hello Jared,
Tuesday, July 18, 2006, 9:05:09 AM, you wrote:
>> % defining natural numbers
>> natural(zero).
>> natural(s(X)) :- natural(X).
>>
>> % translate to integers
>> toInt(zero, 0).
>> toInt(s(X), N) :- toInt(X, Y), N is Y + 1.
> Thank you. I can now more precisely state that what I'm try
Hello Jared,
Tuesday, July 18, 2006, 11:12:09 PM, you wrote:
>> >> % defining natural numbers
>> >> natural(zero).
>> >> natural(s(X)) :- natural(X).
>> >>
>> >> % translate to integers
>> >> toInt(zero, 0).
>> >> toInt(s(X), N) :- toInt(X, Y), N is Y + 1.
>>
>> > Thank you. I can now more precis
Hello Simon,
Simon, you are administrator of many haskell mail lists, so i wrote to
you. last day i don't receive messages in these mail lists.
investigating the problem, i found on haskell-cafe subscription page
that there are some problems in mail delivery to my address. i'm not
100% sure but i
Hello Maurício,
Thursday, July 20, 2006, 1:22:01 AM, you wrote:
>I want to open for reading a log file that another process is locking
> for write. I know it's possible, since 'cat' and 'vim' can read that
> file (but not edit it, of course). How can I do that in Haskell?
> 'openFile' says
Hello Chad,
Thursday, July 20, 2006, 9:38:43 PM, you wrote:
> I suppose the same holds for runSTUArray, right? But this still gives
> me that same error, about being less polymorphic than expected.
there is well-known problem with that _unboxed_ arrays aren't
polymorphic. Oleg Kiselyov proposed
Hello Simon,
Friday, July 21, 2006, 7:46:15 AM, you wrote:
> | ps: you successfully going through all the standard Haskell troubles
> in
> | this area :) seems that making FAQ about using ST monad will be a
> | good idea :)
> Indeed. If someone would like to start one, a good place for it would
Hello Bryan,
Saturday, July 22, 2006, 4:40:58 AM, you wrote:
> Forgive me for not understanding, but I was hoping you would explain a
> choice you made in your code. Why did you define foreach and then use
>> foreach [1..n] (\x -> modifySTRef r (*x))
> Instead of simply using
>> mapM_ (\x -> mo
Hello Brian,
Sunday, July 23, 2006, 1:20:36 AM, you wrote:
> instance IString ByteString.Char8 ...
> instance IString String ...
i think that we should ask Donald Stewart who is patronized SoC
project involving development of such type class. If he will say that
such type class is not developed,
Hello Matthew,
Sunday, July 23, 2006, 10:35:41 AM, you wrote:
>> sequence $ [ reffill b s | s <- [0..(fi temits)-1], b <- [0..(fi
> nc)-1]]
> Now thats interesting. I can see that this function is more appropriate
> since I do not need to retrieve data from the IO monad,
> but what I don't
Hello Pepe,
Sunday, July 23, 2006, 5:23:18 PM, you wrote:
>> 1) Lack of debugging support. Yes there are print statements and trace,
> You can find more info about this project in the Haskell wiki at:
> http://haskell.org/haskellwiki/Ghci/Debugger
> All you'd need to do is to compile ghc-6.5
Hello Brian,
Sunday, July 23, 2006, 5:31:35 PM, you wrote:
>>> instance IString ByteString.Char8 ...
>>> instance IString String ...
>> class ListLike ce e | ce->e
> class ISeq seq_a a | seq_a -> a where -- (*)
there is also Collection library:
darcs get --partial http://darcs.haskell.org/p
Hello Spencer,
Monday, July 24, 2006, 6:38:17 PM, you wrote:
> I've been writing a Stringable class for my SoC project. You can
> check out the code at
> http://darcs.haskell.org/SoC/fps-soc/Data/Stringable.hs.
i've downloaded full fps-soc repository. 2 questions:
why you don't include this in
Hello Simon,
Monday, July 24, 2006, 2:53:21 PM, you wrote:
>> is this will be really usable without gui support? your project is
> I think this work is important because it gives everyone access to debugging
> facilities with the minimum of hassle. If you're already using GHCi, then you
> can s
Hello Dmitri,
Tuesday, July 25, 2006, 8:15:41 PM, you wrote:
> class Eq a => MyOrd a where
> (%<=), (%>), (%>=) :: a -> a -> Bool
> x %<= y = (x < y || x == y)
> x %> y = y < x
> x %>= y = (y < x || x == y)
you are mixing definition of class and its (default) ins
Hello Ralf,
Tuesday, July 25, 2006, 9:59:58 PM, you wrote:
> Dmitri is not necessarily "mixing [...] class and its (default)
> instance".
sorry, i was thoughtless. it really seems like a mistake in use MyOrd
class instead of attempt to use Ord operations. Dmitri should know
better :)
--
Best
Hello Krasimir,
Wednesday, July 26, 2006, 10:46:13 AM, you wrote:
>The FilePath abstraction was discussed a number of times and it
> seems that people prefer an ADT representation instead of plain
> String. I tend to agree. Maybe such ADT based library can be
> integrated with some new IO lib
Hello Udo,
Wednesday, July 26, 2006, 9:41:58 PM, you wrote:
> - parameterize the FilePath ADT on the character type, you get (FilePath
> Word16) on Windows (which uses UCS-2, not UCS-4 and not UTF-16) and
if i correctly understand, UCS-2 uses 2 bytes for ANY char, while
UTF-16 uses 2 or 4 byte
Hello Duncan,
Wednesday, July 26, 2006, 7:34:50 PM, you wrote:
>> Exactly. I believe, a FilePath should be an algebraic datatype.
>> Most operations on that don't have to be specified, because they are
>> simple and have an obvious effect. Add a system specific parser and a
>> system specific r
Hello Andrew,
Thursday, July 27, 2006, 10:07:11 PM, you wrote:
>> I admit I don't know enough to say how the lpt1 issue should be
>> handled. Is there any Win32 call I can make that will help me avoid
>> accidentally opening these magic files? Say, if I call open with
>> O_CREAT | O_EXCL? Unfo
Hello Udo,
Thursday, July 27, 2006, 8:53:10 PM, you wrote:
> Ah, never mind, I get the strong feeling I really don't want to know all
> this. When even Windows 98 has been end-of-lifed we should rely on the
> Unicode API, if anything.
i don't think we can do this in _compiler's system libraries
Hello frederic,
Friday, July 28, 2006, 10:44:51 AM, you wrote:
> much slower than the C version. I would be very grateful if someone
> cared to explain why this is unefficient and how to make it faster
update :: STUArray s (Int, Int) Double -> Int -> Int -> Int -> ST s ()
update arr i j k = do
Hello Olof,
Monday, July 31, 2006, 3:56:45 PM, you wrote:
> 1) reading UTF-8 coded text files into unicode-enabled Strings, lets call
> them UString
> 2) writing UStrings to UTF-8 coded text files
> 3) using unicode strings in-code, that is in my .hs files
first solution: http://haskell.org/has
Hello Piotr,
Monday, July 31, 2006, 4:23:16 PM, you wrote:
>> first solution: http://haskell.org/haskellwiki/Library/Streams
> Looks nice. Just a quick question - does it have an equivalent of
> read(write)File?
no, but you can borrow this code from ghc's System.IO module, see
below. actually,
Hello Brian,
Tuesday, August 1, 2006, 4:23:53 AM, you wrote:
>> That's a tough call to make. Changing the kind of Sequence to * from *
>> -> * means losing the Functor, Monad, and MonadPlus superclasses and
>> all the various maps and zips.
> But there's no option if you want to be able to suppo
Hello Brian,
Tuesday, August 1, 2006, 4:43:23 AM, you wrote:
> As you've pointed out, there are 2 separate issues that are in danger of
> being confused:
> 1) Forcing all sequence instances to support all operations
> 2) Bundling all the ops into a single huge class
Collections library (darcs ge
Hello John,
Tuesday, August 1, 2006, 6:27:29 AM, you wrote:
> It is best to think of haskell primitives as something completely new,
> they reuse some naming conventions from OO programming, but that doesn't
> mean they suffer from the same limitations. It took me a few trys to
> wrap my brain ar
Hello Stephane,
Tuesday, August 1, 2006, 10:52:06 AM, you wrote:
>except Exception e:
don't look at anything except than "Tackling the awkward squad:
monadic input/output, concurrency, exceptions, and foreign-language
calls in Haskell"
http://research.microsoft.com/Users/simonpj/papers/markt
Hello Einar,
Tuesday, August 1, 2006, 1:58:30 PM, you wrote:
> class ElementType c a | c -> a
> class Foldable c where
> fold :: ElementType c a => (a -> b -> b) -> b -> c -> b
i love it! will it be possible to write smth like this:
class Stream m h | h->m
data T h = (Stream m h) => C (m Int
Hello Ralf,
Wednesday, August 2, 2006, 1:27:39 PM, you wrote:
> Read a sentence like this "If your programming language requires you to
> use functors, you're not getting all the benefits of a modern
> programming environment. See if you can get some of your money back."
in the article "history
Hello Kaveh,
Wednesday, August 2, 2006, 1:56:10 PM, you wrote:
> Question : Could anyone show me a sample of using a monad as a
> statefull variable?
monad is not an "stateful variable", it's the way to organize
computations, rule to join them (as the Ring of Supreme Power ;) ).
i recommend you
Hello Jeremy,
Thursday, August 3, 2006, 12:30:40 PM, you wrote:
> Several people have said that they would prefer a darcs repository
me too
> Is there a formal mechanism to request hosting at darcs.haskell.org
> ? If so, whom do I ask? As a matter of interest, does it make sense
> to provide th
Hello Klaus,
Thursday, August 3, 2006, 2:51:01 PM, you wrote:
> data SimpleExp = Num Int | Add SimpleExp SimpleExp
> data LabelledExp = LNum Int String | LAdd LabelledExp LabelledExp String
> The icing on the cake would be if it would also be possible to have a
> function
> unlabel :: LabeledE
Hello Imam,
Friday, August 4, 2006, 12:19:04 PM, you wrote:
>> (read "56")::Integer
> does it in fact pass the type (Integer) to the
> function (read)?
it tells the compiler that result should be of type Integer. this info
used by compiler to select among the different 'read' instances proper
o
Hello Mark,
Friday, August 4, 2006, 3:03:54 PM, you wrote:
> I've always been a little surprised when this doesn't happen more widely
> for things other than instances. For instance, when IntMap.size,
> Map.size and Set.size (or whatever) are all in scope as "size", it
> should be fairly obvious
Hello Brian,
Friday, August 4, 2006, 8:50:25 PM, you wrote:
> class Bar a b where
> bar :: a -> b
> (*) But there's one exception: you can't use typeclasses to resolve
> overloadings between values and functions because non-function values don't
> have a type of the form A ->
Hello Hans,
Friday, August 4, 2006, 8:17:42 PM, you wrote:
> 1) Haskell is too slow for practical use, but the benchmarks I found
> appear to contradict this.
it's an advertisement :D just check yourself
> 2) Input and output are not good enough, in particular for graphical
> user interfacing
Hello Jason,
Friday, August 4, 2006, 10:01:31 PM, you wrote:
> 15. OO is now tried and true in industry. I would say it's far from
> optimal but people do know they can build large applications (say
> ~100k lines of C++).
it's medium size. GHC is larger :)
--
Best regards,
Bulat
Hello Chris,
Saturday, August 5, 2006, 3:47:19 AM, you wrote:
>> in Haskell before blitting the data (whilst also retaining some
>> semblance of functional programming...)
the best way to optimize Haskell program (with current technologies)
is to rewrite it in strict & imperative manner:
>> cam
Hello Antonio,
Saturday, August 5, 2006, 7:07:17 PM, you wrote:
>>> But there must be a way to populize Haskell!
>> What for?
> On the other hand, individuals that need to belong to an elite, and
> the RTFM crowd, will experience a further frustration to feed their insecure
> personality.
the
Hello Kaveh,
Saturday, August 5, 2006, 11:52:16 AM, you wrote:
> I do not meant to compile Haskell to MSIL/JVM. I meant to compile
> Haskell to the Java or C# itself!
for what? btw, there is a jhc compiler (http://repetae.net/john/) that
translates Haskell to ANSI C which allows to reach OCaml-l
Hello Kaveh,
Saturday, August 5, 2006, 10:16:06 AM, you wrote:
> 1 - monads : there must be something to make a clear tool for a
> none-mathematician programmer. (I still have understanding problems
> with them).
http://haskell.org/haskellwiki/IO_inside and "All about monads"
> 2 - there must b
Hello Bjorn,
Saturday, August 5, 2006, 6:59:33 PM, you wrote:
yes, thank you
>>> 2) Input and output are not good enough, in particular for graphical
>>> user interfacing and/or data base interaction. But it seems there are
>>> several user interfaces and SQL and other data base interfaces for
>
Hello Donald,
Sunday, August 6, 2006, 7:03:45 AM, you wrote:
>> the best way to optimize Haskell program (with current technologies)
>> is to rewrite it in strict & imperative manner:
> Strict, very often, since we get unboxed types out of ghc. Imperative,
> not always (and will be less so with D
Hello algorithms,
Sunday, August 6, 2006, 1:50:42 PM, you wrote:
> listFoldr f y Nil = y
> listFoldr f y (Cons x xs) = f x (foldr f z xs)
this is definitely wrong - using foldr instead of listFoldr and 'z'
appearing from nowhere :)
> listFoldr f y Nil = y
> listFoldr f y (Cons x xs) = f y (lis
Hello Kaveh,
Sunday, August 6, 2006, 12:54:01 PM, you wrote:
>> how can we decrease Haskell popularity?
> Why? Because someone must prevent mean programmers to try Haskell? Or
> it is a bit of old holy codex? Or maybe I must feal tired of hearing
> newbies questions?
all the three and especiall
Hello Piotr,
Monday, August 7, 2006, 5:29:10 PM, you wrote:
> Having someone pay a group of people to hack on Haskell
> implementations would indeed be desirable. Without knowing the details
> Ubuntu looks like a promising model. If we could just find a willing
> billionaire out there...
> If
Hello Johan,
Monday, August 7, 2006, 5:25:34 PM, you wrote:
> think that Haskell would benefit from moving some commonly used
> functionality such as HTTP, SQL and XML support into the standard
> libraries.
http, smtp and other networking protocols - yes. xml/sql is too large
things. actually, h
Hello Ki,
Tuesday, August 8, 2006, 6:34:51 AM, you wrote:
> Unfortunately seq and the strict data declaration is not helpful in general.
> They are only helpful on base values such as Int or Bool.
> What they do is just making sure that it is not a thunk.
> That is if it was a list it would just
Hello Nicolas,
Friday, August 11, 2006, 7:13:26 PM, you wrote:
> Thanks for the pointers, but I think I'm looking for type information
> specific to my program. The VisualHaskell feature of which I am
> And, of course, I'd like this functionality in a multi-platform editor.
besides of Visual Ha
Hello Johan,
Friday, August 11, 2006, 4:43:27 PM, you wrote:
> Haskell was mentioned in an article called "Why Exotic Languages Are
> Not Mainstream" on the blog defmacro.org the other day and I thought
> maybe someone would be interested (i.e. is procrastinating at work and
> need an excuse to d
Hello Chris,
Saturday, August 12, 2006, 4:05:44 AM, you wrote:
> Nine Base Monads:
>IO STM ST ST.Lazy GenParser [] Maybe Either (->)
> Seven MonadTrans:
>ListT ContT ErrorT ReaderT StateT WriterT RWST
i'm not sure, but isn't Id monad also required for completeness?
at least it's includ
Hello haskell,
i'm started to write article about type classes. can you, type gurus,
please check this initial text for correctness in explaining
differences between classes and type classes?
at this moment C++/C#/Java languages has classes and
templates/generics. what is a difference? with a cl
Hello Marc,
Sunday, August 13, 2006, 10:36:39 PM, you wrote:
> In other words: why not overload (:) ?
i have such proposal, more or less complete:
1) define [] as type class and [] and ':' as operations of this class:
class [] c where
[] :: c a -- creates empty container
(:
Hello Shae,
Monday, August 14, 2006, 1:11:49 AM, you wrote:
>> - lack of specialists (and this means lack of teaching, training, books)
> There's lots of interactive teaching and training on #haskell
> What exactly do you think is missing?
high school. while some advanced universities teach FP
Hello Johan,
Monday, August 7, 2006, 7:25:47 PM, you wrote:
(sorry for too late answer)
>> http, smtp and other networking protocols - yes. xml/sql is too large
>> things. actually, haxml package is already included in GHC sources
>> distribution and i think that it should be excluded from there
Hello Kaveh,
Sunday, August 6, 2006, 5:40:26 PM, you wrote:
> I think we need a subset of haskell as a new language (or as a
> developing pattern) to work with and teach and learn more easily as
> you have mentioned.
it called Helium :) but in general problem is what Haskell's way to
deal with
Hello Bulat,
Monday, August 14, 2006, 10:37:37 AM, you wrote:
> i'm started to write article about type classes. can you, type gurus,
> please check this initial text for correctness in explaining
> differences between classes and type classes?
i continue to develop this text. below is list of d
Hello Gabriel,
Tuesday, August 15, 2006, 10:36:28 PM, you wrote:
> | Moreover, Haskell type classes supports inheritance. Run-time
> | polymorphism together with inheritance are often seen as OOP
> | distinctive points, so during long time i considered type classes as a
> | form of OOP implementa
401 - 500 of 1137 matches
Mail list logo
