ot;things") explicitely in the arguments of the main loop (a recursive function) ?
Sorry if it's stupid...
2/
Another one concerning gui library: what's the best choice ? I need it to work both on linux and windows. I also need it can handl
ively-defined data type (like standard haskell list) ?
is-it possible ?
or would it be good to define the data structure in c and write a
haskell wrapper around the c code ?
thank you a lot, bye,
vo minh thu
___
Haskell mailing list
Haskell@haskell.org
2006/3/15, Duncan Coutts <[EMAIL PROTECTED]>:
> On Wed, 2006-03-15 at 17:21 +0100, Sebastian Sylvan wrote:
> > On 3/15/06, minh thu <[EMAIL PROTECTED]> wrote:
> > > hi everybody,
> > >
> > > i have to implement some data structure which is usual
2006/3/15, Paul Johnson <[EMAIL PROTECTED]>:
> "minh thu" <[EMAIL PROTECTED]> wrote:
>
> >2006/3/15, Duncan Coutts <[EMAIL PROTECTED]>:
> >
> >
> >>On Wed, 2006-03-15 at 17:21 +0100, Sebastian Sylvan wrote:
> >>
> >>
&g
say you try to implement it, how do you do it ? c -> ffi -> haskell ?
thanks,
minh thu
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
2006/3/17, minh thu <[EMAIL PROTECTED]>:
> 2006/3/17, Bulat Ziganshin <[EMAIL PROTECTED]>:
> > Hello Jared,
> >
> > Thursday, March 16, 2006, 11:35:24 PM, you wrote:
> >
> > JU> General question to the list:
> > JU> (Q) Are there any data
2006/3/18, Antti-Juhani Kaijanaho <[EMAIL PROTECTED]>:
> Donald Bruce Stewart wrote:
> > antti-juhani:
> >>Yes, it's annoying (it isn't ambigous right now, but it will be again
> >>early next month). Either use an inherently unambiguous format (anything
> >>that writes out or abbreviates the month,
line for the reading/reconstructing more-than-one-Word8 value.
is it already possible ?
would it be interesting to add such capabilities to haskell ? (i think so)
i can try to add it but i need some pointers about how to do it.
thx a lot,
vo minh thu
___
plumbing (maybe another buffer) to read file. so maybe that in all
cases, we're losing efficiency when reading a file ?
also, if our buffer allocation is mandatory, the compiler could put
the right code for us (i.e. choose the best buffer length).
again thx,
minh thu
2006/4/6, Bulat Zigansh
thanks a lot Bulat !
i ve seen the lib use System.Stream which i don't know...
the fact you can discribe a layout then read a file according to the
layout is just a feature i thought about. i'll definitely learn your
library.
minh thu
2006/4/6, Bulat Ziganshin <[EMAIL PROTECTED]&g
iteSTRef sRef (s + 1)
return ret
--
test1 n = acc1 $ replicate n 1
test2 n = acc2 $ replicate n 1
test3 n = acc3 $ replicate n 1
test4 n = runST (test4' n :: ST s Int)
Thanks a lot,
VO Minh Thu
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
thanks for your answers,
i guess i have to look at strictness and such 'optimizations', ...
mt
2006/5/9, Bulat Ziganshin <[EMAIL PROTECTED]>:
Hello minh,
Monday, May 8, 2006, 12:28:35 PM, you wrote:
> acc1 ints = foldr (+) 0 ints
foldl?
> -
hi,
you can add distributed database to your list...
i'm thinking of mnesia in erlang (i don't know erlang).
in fact, you probably could add all the features of erlang :)
cheers,
thu
2006/7/15, Bulat Ziganshin <[EMAIL PROTECTED]>:
Hello Paul,
Saturday, July 15, 2006, 3:33:14 AM, you wrote:
@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell
>
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Just two problems : Monad appears in the url and Warm, fuzzy thing is
filed under t
2008/7/11 Dave Bayer <[EMAIL PROTECTED]>:
> On Jul 11, 2008, at 5:47 AM, Chad Wilson wrote:
>
>> From previous experience with this sort of thing (the expansion of
>> usage for a list(s)), I am thinking you guys have entered a territory
>> better served by a forum. One subscription gets you access
> [snip]
> [EMAIL PROTECTED]: Although this name definitely captures the
> flavor of the mailing list and also conveys a sense of community (with
> the addition of the 's,' thanks to Dan Licata), the double-n is easy
> to mistake for beginners, and a new user would probably have
> difficulty remem
Hi,
It seems to me that basically, a run of Oleg's code is :: IO Int,
not Int, so there is little sense to talk about referential transparencies
by comparing the results of two runs.
It would have sense by making the comparison directly in a single run,
inside the code (using a pure compare funct
2009/3/6 :
>
> As Amr Sabry aptly observed more than a decade ago discussions of
> purity and referential transparency usually lead to confusion and
> disagreement. His JFP paper provided the needed rigor and argued that
> Haskell even _with regular file (stream) IO_ is pure. As was shown
> yester
2009/3/6 Wolfgang Jeltsch :
> Am Freitag, 6. März 2009 13:33 schrieb Matthew Pocock:
>> Hi,
>>
>> It seems every time I look at hackage there is yet another stringy
>> datatype. For lots of apps, the particular stringy datatype you use matters
>> for performance but not algorithmic reasons. Perhaps
2009/3/6 David Menendez :
> On Fri, Mar 6, 2009 at 12:05 PM, Wolfgang Jeltsch
> wrote:
>> Am Freitag, 6. März 2009 17:31 schrieben Sie:
>>> What name would you suggest?
>>
>> If we wouldn’t have to care about compatibility, I would name the class
>> String
>> and drop the type alias String.
>>
>>
2009/4/1 Daniel Lincke :
> Hi Haskellers,
>
> I am looking for a parser which can parse Haskell code and build an
> syntax tree out of it. The syntax tree should be storable in some
> reasonable file format in order to use it as an input for applications
> like programm transformation systems.
> Is
It seems like the infered type (and thus bounds) is different when you
force the result to be a Color or not. Just give explicit type
signatures and conversion functions.
Cheers,
Thu
2012/7/16 Andreas Abel :
> Today a student came to me with a piece of code that worked it executed by
> itself, bu
2010/9/6 Manuel M T Chakravarty :
> Ian Lynagh:
>> To fix this problem, we propose that we create a "haskell.org
>> committee", which is responsible for answering these sorts of questions,
>> although for some questions they may choose to poll the community at
>> large if they think appropriate.
>
2011/3/14 Malte Harder :
> Dear all,
>
> I just released the first version of the Craftwerk graphics library for
> 2d vector graphics. Craftwerk is intended to act as an abstract
> interface to different backend drivers. The library itself has a TikZ
> (http://sourceforge.net/projects/pgf) driver b
24 matches
Mail list logo