and it should preferably make use of the GPU as much as possible, where
it makes sense at least.
Anyway knows about such a framework in Haskell? It's a gigantic undertaking,
but maybe if someone can make the basic framework, others in the community
will develop controls for it?
Cheers,
Peter
On a modern PC, this is no problem at all.
We are actually doing this with a 1920 x 1080 x 32-bit bitmap, at 60 FPS, on
a 2-year old PC
You can easily test your GPU - CPU bandwidth using this tool:
http://sourceforge.net/projects/gpubench
On Fri, Sep 17, 2010 at 7:53 PM, Lie Ryan
Not sure how to do this without GLFW, but with that library, here's the
code:
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=27322#a27322
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=27322#a27322You must convert
your PNG file to a TGA file for GLFW.
On Sun, Jul 11, 2010 at 6:07 AM, Hector
It's interesting to see what will happen to Unity3D. This great casual
game development tool offers support for exporting to iPhone. They are
hit by Apple's new developer license - because they generate code -
but apparently, apps generated by Unity3D do end up in the Apple
store...
Now.. Unity
++ ?
2010/5/24 Peter Verswyvelen bugf...@gmail.com
Yeah. Funny that we're still writing games in C++, while mission
critical and hard real time systems are written in much nicer
languages :)
I made something similar to Lucid Synchrone for a game company I used
to work, but with the purpose
2010/5/24 Patai Gergely patai_gerg...@fastmail.fm
IMO: For AAA game programming? Definitely not. For exploring new ways
of doing game programming and having a lot of fun and frustration?
Sure! For making casual games? I don't know.
Why not casual games? I don't see any immediate
Just to know, have you been told of a language dedicated to reactive
programming (even experimental)? I mean, not an embedded language just like
Yampa is.
Maybe Lucid Synchrone (http://www.lri.fr/~pouzet/lucid-synchrone/) and
Timber (http://www.timber-lang.org)?
Yeah. Funny that we're still writing games in C++, while mission
critical and hard real time systems are written in much nicer
languages :)
I made something similar to Lucid Synchrone for a game company I used
to work, but with the purpose of making reactive programming
accessible to computer
IMO: For AAA game programming? Definitely not. For exploring new ways
of doing game programming and having a lot of fun and frustration?
Sure! For making casual games? I don't know.
On Sun, May 23, 2010 at 9:09 PM, Ben Christy ben.chri...@gmail.com wrote:
I keep asking myself the question is
On Mon, May 24, 2010 at 12:30 AM, Jake McArthur jake.mcart...@gmail.com wrote:
On 05/23/2010 02:17 PM, Peter Verswyvelen wrote:
IMO: For AAA game programming? Definitely not.
Why not? I suppose it may depend on your definition of AAA, since there
doesn't seem to be any consensus on it. I
, 2010 at 6:30 PM, Jake McArthur jake.mcart...@gmail.com
wrote:
On 05/23/2010 02:17 PM, Peter Verswyvelen wrote:
IMO: For AAA game programming? Definitely not.
Why not? I suppose it may depend on your definition of AAA, since there
doesn't seem to be any consensus on it. I have seen it mean
As far as I know, it was never possible to make a pong game in
Reactive, at least not with the versions I tried, but I admit a lot of
never versions got released since then. It would be great to see one
though :)
You might want to try Yampa, that works for sure (although you should
mark all your
a look...
2010/5/16 Peter Verswyvelen bugf...@gmail.com
As far as I know, it was never possible to make a pong game in
Reactive, at least not with the versions I tried, but I admit a lot of
never versions got released since then. It would be great to see one
though :)
You might want to try
Interesting topic. I find it a bit annoying that Haskell doesn't
provide support to save functions. I understand this is problematic,
but it would be very nice if the Haskell runtime provided a way to
serialize (part of) the heap, making sure that pointers to compiled
functions get resolved
As a side note, it's interesting that C# doesn't allow serialization
of closures (anonymous delegates). The compiler-generated name
assigned to an anonymous delegate can be different after each
re-compilation. This is also really annoying in C#/.NET, since one
must explicitly add a named method if
2010/4/25 Patai Gergely patai_gerg...@fastmail.fm:
(in my own FRP experiments I have an update thread and a render thread).
I wonder how to nicely deal with state that requires communication with
the outer world, even though it is functional at heart. For instance, if
you want to change a
Actually, I believe that many Yampa examples do separate the drawing
from the update... The arrow provides the game data that *can* be
rendered. If you provide interpolators for that game data, you can
still achieve the same as is explained in fix your timesteps (in my
own FRP experiments I have
So the first computer nerd was a women??!!! ;-) ;-) ;-)
On Sat, Mar 27, 2010 at 9:06 PM, John Van Enk vane...@gmail.com wrote:
http://en.wikipedia.org/wiki/Grace_Hopper
A heck of a lady.
On Sat, Mar 27, 2010 at 12:51 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Ozgur Akgun
On Sun, Mar 7, 2010 at 10:01 AM, sinelaw jones.noa...@gmail.com wrote:
I don't think a deep knowledge of physics is what we lack here, at
least for the question of continuous vs. discrete time. Maybe the best
physical model for nature really does involve discrete time steps.
However, for our
On Wed, Mar 3, 2010 at 8:45 PM, sinelaw jones.noa...@gmail.com wrote:
But isn't Lucid Synchrone essentially discrete-timed? Also, events
Maybe reality itself can also be modeled using discrete timesteps? If
so, then a discrete clock calculus might make a lot of sense. I don't
know much about
Well the precompiled one provided on doesn't seem to work with GHC
6.12.1, you get an error.
So yes, it would be nice to at least update the precompiled version on
the website :-)
On Thu, Mar 4, 2010 at 7:41 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Peter Verswyvelen wrote:
Using
A fully concurrent GC running on multiple threads/cores might be
great, but I guess this is difficult to implement and introduces a lot
of overhead.
For simple video games, it might work to always do a full GC per
frame, but don't allow it to take more than T milliseconds. In a sense
the GC
Using GHC 6.12.1 on Windows currently is hard, since one must compile
the latest version of cabal-install, which is a nightmare to do for a
typical windows user (install mingw, msys, utils like wget, download
correct package from hackage, compile them in correct order, etc etc)
What's the status
) (realToFrac y)
In the definition of `glVertex2':
glVertex2 x y = Vertex2 (realToFrac x) (realToFrac y)
On Wed, Sep 30, 2009 at 4:06 PM, Peter Verswyvelen bugf...@gmail.com wrote:
I don't want to use the GL types directly since the OpenGL renderer is not
exposes in the rest of the API.
I
Sounds like we need to come up with some benchmarking programs so we
can measure the GC latency and soft-realtimeness...
PS: Regarding Haskell and games: the University of Utrecht teaches
Haskell in their brand new game technology course :-)
On Mon, Mar 1, 2010 at 1:04 AM, Luke Palmer
The original author said he did not want to use existing parser
libraries, but write it himself for learning. After I read
introduction to functional programming from Bird, I closed the book,
and re-wrote the parser from scratch again, and seeing how all these
pieces come together was such a
On Sun, Nov 1, 2009 at 2:57 AM, Gregory Collins g...@gregorycollins.netwrote:
Doing OO-style programming in Haskell is difficult and unnatural, it's
true (although technically speaking it is possible). That said, nobody's
yet to present a convincing argument to me why Java gets a free pass for
revision or extension?
Would a feature like this be preferable over typeclasses? Would it be
practical to implement? Are people working on this?
Thanks,
Peter Verswyvelen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Peter Verswyvelen
Sent: 13 January 2010 09:52
To: Gregory Collins
Cc: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] How to fulfill the code-reuse destiny of OOP?
On Sun, Nov 1, 2009 at 2:57 AM, Gregory
Nice work!
Did you try the OpenAL binding? Not sure if that works.
2009/12/14 Patai Gergely patai_gerg...@fastmail.fm:
Hello all,
I just uploaded the fruit of a little side project. Hemkay [1] is an
oldschool module music [2] player that performs all the hard work in
Haskell. If there was
How are things like this handled in say - Morrow - using extensible
records? I guess when one defines functions operating on extensible
records you get a lot of reuse for free (in Andrew's example, you
would just extend the record with either a Checked or Unchecked label)
On Fri, Dec 11, 2009 at
Yes I remember when watching Erik Meijer's videos on Channel9 he said
a similar thing: laziness in the presence of side effects makes your
head explode...
I guess the recent Microsoft Rx framework for .NET (that permits
impure push-based functional reactive programming with LINQ) will soon
show
Nice.
It would be fantastic to have a little practical real-world challenge
(like building a simple music system, or a simple multi-channel sound
mixer), and work this out in an imperative language, an
object-oriented language, a functional language, and maybe other
languages too, like logic
Regarding speeding up linking or compilation, IMO the real speedup you
would get from incremental compilation linking. It's okay if the
initial compilation linking take a long time, but the duration of
next cl iterations should only depend on the number of changes one
does, not on the total
The following is purely my own experience, I have no links to papers
of clever people :)
I think none of the inheritance techniques work perfectly. E.g.
describing everything with OO interfaces (=a extensible record of
function pointers) is also problematic IMHO, at least when you have
side
Nice article from Bartosz , thanks for sharing this.
The best comment (and oh so true IMO) on his article is:
I agree, however, a little more familiarity than that may result in
the desire never to see another line of C++ again, so you have to be
careful.
Although learning Haskell improved my
types (function and number), and the only
expression components are let, lambda, apply, identifier, and number. If
something like that would work, let me know.
Hope that helps,
- Job
On Tue, Oct 20, 2009 at 10:07 AM, Peter Verswyvelen bugf...@gmail.com
wrote:
For learning, I would like
For learning, I would like to develop my own implementation of type
inference, based on the paper Typing Haskell in Haskell.
At first sight, the source code of THIH contains a small number of
tests, but I was wandering if a large test set exist?
Thanks,
Peter
If you're a Windows developer and don't want to spent time to learn all the
alien emacs keyboard shortcuts, you can get going quickly by using this
emacs patch:
http://ourcomments.org/Emacs/EmacsW32.html
http://ourcomments.org/Emacs/EmacsW32.htmlThen use set all to Emacs!W32
and your keys behave
On Mon, Oct 12, 2009 at 1:08 AM, Felipe Lessa felipe.le...@gmail.comwrote:
On Mon, Oct 12, 2009 at 12:42:16AM +0200, Peter Verswyvelen wrote:
btw I always find it amusing to play with interact and lazy IO:
I always find it frightening to play with lazy IO :).
yes, I guess that's why I like
It always helps to put a Debug.Trace.trace:
in if trace (show (fromEnum c)) $ c == ((!!) ht
randInt) then p
What's your guess, heads or tails ('h' or 't')?
h
104
You win!
What's your guess, heads or tails ('h' or 't')?
*10*
You lose!
What's your guess, heads or tails ('h' or
) gen
cs = map (ht!!) rs
interact $ unlines . guess cs . lines
On Mon, Oct 12, 2009 at 12:24 AM, Peter Verswyvelen bugf...@gmail.comwrote:
It always helps to put a Debug.Trace.trace:
in if trace (show (fromEnum c)) $ c == ((!!) ht
randInt) then p
What's your guess
Mmm, that seems like a shortcoming.
Well, you could just wrap the C functions yourself, like this (two
possibilities, no error checking yet, quick hack):
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=10565#a10565
Note that using SetEnvironmentVariable does not seem to be compatible with
getEnv,
interesting.
the sequences you get are random, but unless you enter a new number that is
really far from the previous one, the probability of getting the same first
random number seems high.
import System.Random
import Control.Monad(when)
main = do
numberString - getLine
when (not $ null
record systems exist),
*and* get the same easy to understand errors?
What were the problems with Trex (if any)?
Thanks,
Peter Verswyvelen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I don't have an answer to your question, but I asked a similar one a while
ago:http://www.mail-archive.com/haskell-cafe@haskell.org/msg53872.html
http://www.mail-archive.com/haskell-cafe@haskell.org/msg53872.htmlRyan
Ingram gave an answer:
--- BEGIN NOSTALGIA ---
Well, I have to add to this, that when I coded my first games in assembler
in the eighties, I did exactly the same thing: just recording the input of
the joystick was enough to get full replays and make auto playing demos.
But on the old computers, this was all so easy,
, Oct 7, 2009 at 10:05 AM, Peter Verswyvelen bugf...@gmail.com
wrote:
over every bit of the system (it was even easy to count exactly how many
cycles a routine would take :-), so it was just a matter of starting the
You sound like you used to code on the Commodore 64 :)
David
On Wed, Oct 7, 2009 at 11:13 AM, Ketil Malde ke...@malde.org wrote:
One could argue that IO should be broken down into a set of sub-monads
encapsulating various subsets of the functionality - file system,
network access, randomness, and so on. This could extend the safe
spot to cover much
On Thu, Oct 1, 2009 at 9:53 AM, Andrew Coppin
andrewcop...@btinternet.comwrote:
Sure. But what is a computer program? It's a *list of instructions* that
tells a computer *how to do something*. And yet, the Haskell definition of
sum looks more like a definition of what a sum is rather than an
are again functions that
extract information from the object), and that is most likely again the
co-algebraic approach?
On Wed, Sep 30, 2009 at 9:15 PM, Luke Palmer lrpal...@gmail.com wrote:
On Wed, Sep 30, 2009 at 9:54 AM, Peter Verswyvelen bugf...@gmail.com
wrote:
I guess this is related
Yep, LINQ makes C# more enjoyable :-) Scala and haXe also look nice, a bit
of a mix between OCaml/F#, C#/Java and Haskell.
Besides the fact that hacking in Haskell is a great deal of fun, the main
reason I see for learning Haskell: it makes you a better programmer. After
a couple of years of
I really doubt people tend to think in either way. It's not even sure our
thinking can be modeled with computing no?
On Wed, Sep 30, 2009 at 1:58 PM, Jochem Berndsen joc...@functor.nl wrote:
Deniz Dogan wrote:
2009/9/30 Andrew Coppin andrewcop...@btinternet.com:
(Mr C++ argues that homo
The newest package seems to require using GLdouble/GLfloat.
What is the most efficient way to convert Double/Float to GLdouble/GLfloat?
I'm currently using realToFrac. But essentially the operation should be a
nop on my machine.
I haven't looked at the core code yet (on Windows, last time I
Mmm, to the average student calculus is still very obscure ;-)
On Wed, Sep 30, 2009 at 3:56 PM, Kalani Thielen kthie...@lab49.com wrote:
As one C++ expert I know is fond of telling me, Haskell will only
become popular when obscure mathematics becomes popular.
That might be true, but the
would say: each frame, the ball's position moves by a tiny
timestep; when the mouse is sampled, copy the mouse position to the paddle;
etc...
On Wed, Sep 30, 2009 at 4:43 PM, Andrew Coppin
andrewcop...@btinternet.comwrote:
Peter Verswyvelen wrote:
I really doubt people tend to think in either
I don't want to use the GL types directly since the OpenGL renderer is not
exposes in the rest of the API.
I was hoping that realToFrac would be a nop in case it would be identical to
an unsafeCoerce.
I guess one could make rules for that, but this tickets makes me wander if
that really works:
I guess this is related to the expression problem.
Suppose I have a datatype
*data Actor = Ball ... | Paddle ... | Wall ...*
and a function
*move (Ball ...) = *
*move (Paddle ...) = *
*move (Wall ...) = *
in Haskell one must put *Actor* and *move* into a single file.
This is rather cumbersome
Yes, the OOHaskell paper blew my mind too, but I still only understood half
of it when reading it for the second time (especially the mfix thing was
scary :-) Not giving up though ;-)
But I wander if the error messages you would get from GHC make it easy to
see what is going wrong. It would be
-2724 x 101
On Sep 27, 2009, at 3:38 PM, Peter Verswyvelen wrote:
That's not really true. Just use CAL from the Open Quark framework... It's
almost Haskell 98, with some extras, and compiles to fast JVM code.
http://openquark.org/Open_Quark/Welcome.html
http://openquark.org/Open_Quark
He meant 16-bit floats, which have sizeOf 2
On GPUs this is common and implemented in hardware (at least on the old
GPUs).
On DPSs you commonly had 24-bit floats too.
But these days I guess 32-bit is the minimum one would want to use? Most of
the time I just use double anyway :)
On Sun, Sep 27,
That's not really true. Just use CAL from the Open Quark framework... It's
almost Haskell 98, with some extras, and compiles to fast JVM code.
http://openquark.org/Open_Quark/Welcome.html
http://openquark.org/Open_Quark/Welcome.htmlThey even seem to do all kinds
of advanced optimizations - like
Thanks a lot for the answers.
Another feature I really miss is type parameterized modules.
For example, suppose I have a module that defines simple geometry / linear
algebra math, with types like Vector a, Matrix a, Point a, Size a, Rectangle
a, etc...
Usually when you import such a module, you
over a static one.
Thanks a lot,
Peter Verswyvelen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
This is seriously cool stuff!!!
Maybe it's time to start a Haskell Demo Scene :-)
(what's a demo scene? See http://en.wikipedia.org/wiki/Demoscene )
PS: Note that Conal Elliott also was generating GPU code using Haskell
with Vertigo back in 2004: http://conal.net/papers/Vertigo/
On Thu,
I would also like to see a solution for problems like these.
Haskell provides a lot of nice memoizing / caching data structures -
like a trie - but the ones I know indeed keep growing, so no garbage
collection takes place?
It would be nice to have a data structure that performs caching but
does
hope that
eventually tail calls will work as expected, and fast
See e.g.
http://blogs.msdn.com/clrcodegeneration/archive/2009/05/11/tail-call-improvements-in-net-framework-4.aspx
So, might it be worth considering a .NET backend for a Haskell compiler?
Peter Verswyvelen
/pipermail/haskell-cafe/2005-January/008244.html
and there are some .Net interop implementations on the net (it is a question
how mature they are, however):
http://php.cin.ufpe.br/~haskell/haskelldotnet/
http://haskell.forkio.com/dotnet/
2009/9/16 Peter Verswyvelen bugf...@gmail.com
I heard
It is possible for an executable with less privileges to
shellexecute an executable that requires admin rights? Won't this
immediately raise an access denied or other security exception
again? Don't know, it might be possible, but it's worth to check it
out before going this route (which is rather
Yes, I'm aware of that, but not the details, so thanks for the info.
Anyway, I quickly tested Regis's idea in C#, and it works as he said.
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=9392#a9392
- When trying to create a folder in ProgramFiles, you get an access
denied exception, unless the
I did that once a long time ago using GTK2HS; but I don't have that
code anymore I think, it was a quick hack anyway.
Doing a search for plot on Hackage revealed
http://hackage.haskell.org/package/Chart
http://hackage.haskell.org/package/gnuplot
Maybe that helps.
On Mon, Sep 14, 2009 at 4:42
Actually, this UAC was already present in Vista no?
On Thu, Sep 10, 2009 at 4:18 AM, Jeff Wheeler j...@nokrev.com wrote:
On Wed, Sep 9, 2009 at 2:19 PM, Sebastian
Sylvansebastian.syl...@gmail.com wrote:
I think it's morally right to run as user by default. Yes, the windows
culture has some
Interestingly, a sudo for Windows does seem to exist. It's called the
runas command. At first sight it existed already since Windows XP
Also on Sourceforge an open source sudo command for Windows is hosted:
http://sourceforge.net/projects/sudowin
On Thu, Sep 10, 2009 at 11:21 AM, Peter
No Windows XP did not have support for roaming profiles yet I think.
But it wouldn't be too difficult to use %LOCALAPPDATA% first, and when
it doesn't exist, use %APPDATA%?
This article explains a lot about the differences; I didn't have time
yet to read it in detail
You might want to watch out for multithreading issues, although in
this case, I don't think it will cause sever problems, besides a
couple of redundant cache updates.
On Thu, Sep 10, 2009 at 2:07 PM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello staafmeister,
Thursday, September 10,
On Thu, Sep 10, 2009 at 11:47 AM, Roman Cheplyaka r...@ro-che.info wrote:
step x g a = g (f a x)
is, thanks to currying, another way to write
step x g = \a - g (f a x)
I thought currying just meant
curry f x y = f (x,y)
Isn't the reason that
f x y z = body
is the same as
f = \x - \y
Yes, it's true that most people tended to be administrators on their
own Windows desktops, but since Vista, this has changed.
Now in Vista, some people still forced admin rights, to get rid of the
many annoying dialog boxes that popped up for every tiny task that
might be a security breach.
But
Congratulations!
On Wed, Sep 9, 2009 at 5:47 PM, Paul Lnine...@gmail.com wrote:
I'm pleased to annouce that a library for Causal Commutative Arrows
(CCA) has been uploaded to Hackage DB. It implements CCA normalization
using Template Haskell and a modified arrow pre-processor (based on
I tried the cabal install command on Windows 7, and I had to run it
with administrative privileges, otherwise I got access denied (it
failed to create the Haskell folder in C:\Program Files)
Not sure if this is also the case on Vista.
Is this the intended behavior?
? (It may already, but I noticed that the default seems to
be global.)
I don't know what technical challenges there are, but the ApplicationData
directory (or AppData, or whatever) seems like a good place to stick user
cabal packages.
/jve
On Tue, Sep 8, 2009 at 9:31 AM, Peter Verswyvelen bugf
an ST monad?
I'm not sure if any of this is valid, but I would like to understand
more about this, so any links and hints are welcome :-)
Peter Verswyvelen
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
WindowDescription copies no (whether the fields are strict or not)? So
ideally for performance, all these updates should be fused, maybe
running inside an ST monad?
I'm not sure if any of this is valid, but I would like to understand
more about this, so any links and hints are welcome :-)
Peter
When ones makes an ADT with data constructors that has strict (and
maybe unpacked) fields,
e.g.
data Vec2 a = Vec2 {-# UNPACK #-} !a {-# UNPACK #-} !a
how does one define an NFData instance?
Like this?
instance NFData a = NFData (Vec2 a) where
rnf (Vec2 x y) = rnf x `seq` rnf y
Or is it
Although also a bit of a global hack, you could also hide one of the
packages using
ghc-pkg hide mtl-1.1.02
instead of uninstalling them I think.
Also, if you make a cabal file, you could specify the exact module you
want to use.
On Fri, Sep 4, 2009 at 11:03 PM, Michael
an ideal
opportunity to associate a cached object with another object without
needing to wrap a lot of code in a monad
On Wed, Sep 2, 2009 at 1:25 AM, Brandon S. Allbery
KF8NHallb...@ece.cmu.edu wrote:
On Sep 1, 2009, at 14:57 , Peter Verswyvelen wrote:
In .NET it is possible to assign an identifier
a
deRefStableName function, which, since there isn't one, probably means
that such a function would be hard to make.
- Job
On Sun, Aug 30, 2009 at 4:54 PM, Peter Verswyvelen bugf...@gmail.comwrote:
From the documentation, I don't think I grasp how stable names work.
From the docs
, how are you planning on using them?
- Job
On Tue, Sep 1, 2009 at 3:40 AM, Peter Verswyvelen bugf...@gmail.com wrote:
but without that function, stable names are not that useful I guess? they
would cause a space leak?
On Mon, Aug 31, 2009 at 10:59 PM, Job Vranish jvran...@gmail.com wrote:
I
Maybe the chapter on monad transformers in RWH can help?
http://book.realworldhaskell.org/read/monad-transformers.html
On Tue, Sep 1, 2009 at 7:34 PM, Colin
Adamscolinpaulad...@googlemail.com wrote:
I'm trying to add a state monad onto the IO monad for use in a
happstack application. I
?
- Job
On Tue, Sep 1, 2009 at 3:40 AM, Peter Verswyvelen bugf...@gmail.com wrote:
but without that function, stable names are not that useful I guess? they
would cause a space leak?
On Mon, Aug 31, 2009 at 10:59 PM, Job Vranish jvran...@gmail.com wrote:
I also would like a isStableNameTargetAlive
Well, Steve wrote:
I compared the top 10 C/C++ results against the top 10 Haskell results:
So to me it seems he's not talking about his code.
Anyway, I thought Haskell's ByteString IO should not be that much slower
anyway.
Not sure how lazy ByteString IO is implemented, but if it performs
On Sun, Aug 30, 2009 at 2:51 PM, Bulat Ziganshin
bulat.zigans...@gmail.comwrote:
these all are different things, and talking about ByteString IO speed
is the same as talking of speed of red cars
Okay, but statistically, most red cars are very fast Ferrari's no? :-)
Maybe this can help?
http://hackage.haskell.org/package/ansi-terminal
http://hackage.haskell.org/package/ansi-terminal
On Sun, Aug 30, 2009 at 4:24 PM, Paul Sujkov psuj...@gmail.com wrote:
Hi,
is there any (by any means) portable ASCII-Graphics library for Haskell,
such as NCurses or AALib?
From the documentation, I don't think I grasp how stable names work.
From the docs:
There is no deRefStableName operation. You can't get back from a stable
name to the original Haskell object. The reason for this is that the
existence of a stable name for an object does not guarantee the existence
conio.h kbhit c_kbhit :: IO CInt
On Sun, Aug 30, 2009 at 4:42 PM, Paul Sujkov psuj...@gmail.com wrote:
Hi Peter,
yes, this seems like what I actually want. Thank you :)
2009/8/30 Peter Verswyvelen bugf...@gmail.com
Maybe this can help?
http://hackage.haskell.org/package/ansi-terminal
I'm reading the book Modern Compiler
Designhttp://www.cs.vu.nl/~dick/MCD.html,
and in the chapter about functional programming it is stated that strictness
analysis in the presence of ADTs (aka records) is a very hard problem to
tackle.
I'm not sure what the current state of art is here (e.g GHC
Ouch, with all the great Haskell parsers like Parsec around I think I was
expecting a line/column number :-)
But I see a ticket is already open for this
http://trac.haskell.org/haddock/ticket/83
http://trac.haskell.org/haddock/ticket/83On Wed, Aug 26, 2009 at 2:47 AM,
Gwern Branwen
Several libraries define their own codes for they keyboard (GLFW, GTK, GLUT,
etc)
Maybe it would be nice to agree on a standard datatype for keys? This might
also include digital buttons on a joystick, etc...
The Windows API has virtual key codes for this.
Gale g...@sefer.org wrote:
Peter Verswyvelen wrote:
Several libraries define their own codes for they keyboard (GLFW, GTK,
GLUT,
etc)
Maybe it would be nice to agree on a standard datatype for keys? This
might
also include digital buttons on a joystick, etc...
The Windows API has
, 2009 at 1:04 PM, David Waern david.wa...@gmail.com wrote:
2009/8/26 Peter Verswyvelen bugf...@gmail.com:
Ouch, with all the great Haskell parsers like Parsec around I think I was
expecting a line/column number :-)
But I see a ticket is already open for this
http://trac.haskell.org/haddock
I would already be happy with a low level library that holds the union of
all keys, assigning them unique codes. So you would have keys like Apple,
Amiga, Windows, Start, Popup, LeftControl, RightControl, etc... No mapping
is done at the low level.
Then one would need an OS dependent interface to
1 - 100 of 617 matches
Mail list logo
