On Jan 27, 2008 3:06 AM, Don Stewart [EMAIL PROTECTED] wrote:
berlin.brown:
I started a AMQP library; there really isn't a lot there but at least
I was able to connect to the server. Here is the code and hopefully
someone else can continue with the project. The AMQP protocol is
On Wed, 2008-01-23 at 13:29 +, Simon Peyton-Jones wrote:
Friends
Over the next few months I'm giving two or three talks to groups of
*non* functional programmers about why functional programming is
interesting and important. If you like, it's the same general goal as
John Hughes's
berlin.brown:
I started a AMQP library; there really isn't a lot there but at least
I was able to connect to the server. Here is the code and hopefully
someone else can continue with the project. The AMQP protocol is
moderately complex. HTTP is simple and stuff like RMI, JMS, Database
Hello Paul,
Saturday, January 26, 2008, 11:03:30 PM, you wrote:
* Say computers are cheap but programmers are expensive whenever
explaining a correctness or productivity feature.
This is true only if talking to people in high-income nations.
Even in low-income nations, its only
Hello Dipankar,
Sunday, January 27, 2008, 12:16:38 AM, you wrote:
Anyway, no we're older, and we realize that it would have helped our math
understanding out quite a bit had we learned more physics, engineering,
etc. Or had we learned 19th century mathematics well. The Russian program
seems
Hello Stefan,
Sunday, January 27, 2008, 1:14:46 AM, you wrote:
But historically, computers have been available at all kinds of price
ranges, so people chose the price point that fit them. So, for the last
15 years or so already computers have been chosen (in the wealthy
countries) to be
Hello jerzy,
Sunday, January 27, 2008, 1:48:07 AM, you wrote:
I've often heard from my Eastern European colleagues that they learned
almost nothing about computer science back home...
===
Well, I have the impression, at least I intended to say just the reverse
(not the opposite), that the
Berlin Brown wrote:
I started a AMQP library; there really isn't a lot there but at least
I was able to connect to the server.
Arrgh: I was hoping I would be the first to announce this. I've been
working on one (on and off) for a few months now. I've got most of the
translation from XML
Don Stewart wrote:
berlin.brown:
I started a AMQP library; there really isn't a lot there but at least
I was able to connect to the server. Here is the code and hopefully
someone else can continue with the project.
Thanks!
Would you like this packaged up for hackage.haskell.org, so
Isaac Dupree wrote:
Derek Elkins wrote:
and you can have
unboxed values in dynamically typed languages.
really? Sure that's possible as an optimization, but I thought that to
explicitly specify that would require a known static type. Or perhaps
the bit-tagging by which some Scheme
On Fri, 25 Jan 2008, Stephan Friedrichs wrote:
Hi all,
is someone familiar with compiling ndp (nested data parallel Haskell),
Speed with less convenience-version?
I followed the guide at
http://www.haskell.org/haskellwiki/Data_Parallel_Haskell/PackageNDP but
executing make in the
Hi
Perhaps a more modern approach would be StAX[1]-like rather than SAX-like? In
either case, streaming, non-DOM.
Remember, Haskell has lazy evaluation. TagSoup is basically a SAX
approach, without the massive pain of the Java version and the API
being back to front compared to what you want.
On Sun, 2008-01-27 at 11:49 +0300, Bulat Ziganshin wrote:
Hello Dipankar,
Sunday, January 27, 2008, 12:16:38 AM, you wrote:
Anyway, no we're older, and we realize that it would have helped our math
understanding out quite a bit had we learned more physics, engineering,
etc. Or had we
Suggestion: a binding to Expat, like perl and python did.
So this is a request for an xml-light based on lazy bytestrings, designed
for speed at all costs?
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Achim Schneider wrote:
Will there be a chapter on OpenGL?
Please, don't.
With the current state of Haskell's openGL, all you need is the redbook
and a sed command that removes the 3f from vertex3f.
I'm not going to try to make a case for the authors of RWH to do a
chapter on OpenGL. I
On Jan 27, 2008 11:49 AM, Bulat Ziganshin [EMAIL PROTECTED] wrote:
oh, yes, they are really still study 19th century physics, but not
because of great mind, but due to age of university professors. i've
studied at Moscow University in 89-91 and department of computer
languages still studied
paul:
Don Stewart wrote:
berlin.brown:
I started a AMQP library; there really isn't a lot there but at least
I was able to connect to the server. Here is the code and hopefully
someone else can continue with the project.
Thanks!
Would you like this packaged up for
That's a great little job actually. I'll have a go!
stevelihn:
Suggestion: a binding to Expat, like perl and python did.
So this is a request for an xml-light based on lazy bytestrings, designed
for speed at all costs?
-- Don
___
matthew.pocock:
On Saturday 26 January 2008, Keith Fahlgren wrote:
Perhaps a more modern approach would be StAX[1]-like rather than SAX-like?
In either case, streaming, non-DOM.
I am concerned by the number of people expressing willingness to abandon
namespace support, but perhaps I'm
Recently I've been developing my IRC bot a little further, and in the
midst of it I have come across a very problematic issue that revolves
around GHC-dependencies vs. application-dependencies. The central issue
is ByteString.
Currently, the ghc package depends on bytestring-0.9.0.1. However, the
mad.one:
Recently I've been developing my IRC bot a little further, and in the
midst of it I have come across a very problematic issue that revolves
around GHC-dependencies vs. application-dependencies. The central issue
is ByteString.
Currently, the ghc package depends on
On Jan 27, 2008 12:24 PM, Don Stewart [EMAIL PROTECTED] wrote:
It should be possible to specify that your lib depends on exactly
0.9.0.1 in the .cabal file.
In the same general area. When you upgrade something like bytestring
and have to update everything that was built with it (otherwise
brian.sniffen:
On Jan 27, 2008 3:49 AM, Bulat Ziganshin [EMAIL PROTECTED] wrote:
a few months ago i
have a conversation with today student and they still learn Lisp (!!!).
it seems that they will switch to more modern FP languages no earlier
that this concrete professor, head of PL
On Jan 27, 2008 3:49 AM, Bulat Ziganshin [EMAIL PROTECTED] wrote:
a few months ago i
have a conversation with today student and they still learn Lisp (!!!).
it seems that they will switch to more modern FP languages no earlier
that this concrete professor, head of PL department, which in 60s
Does anyone have a C# parser written in Haskell?
Thanks, Joel
--
http://wagerlabs.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
You mean as the the POPL paper, http://lambda-the-ultimate.org/node/2622 ?
On Jan 27, 2008 10:30 PM, Don Stewart [EMAIL PROTECTED] wrote:
And just as PLT Scheme announces they're moving to immutable, pure lists
http://lambda-the-ultimate.org/node/2631
They'll be getting a type system soon,
On Sun, 2008-01-27 at 14:30 -0800, Don Stewart wrote:
brian.sniffen:
On Jan 27, 2008 3:49 AM, Bulat Ziganshin [EMAIL PROTECTED] wrote:
a few months ago i
have a conversation with today student and they still learn Lisp (!!!).
it seems that they will switch to more modern FP languages
Well, the POPL talk was very pro-types, saying that when you move from a
scripting language to a language to write real systems you need static
types.
On Jan 27, 2008 9:52 PM, Derek Elkins [EMAIL PROTECTED] wrote:
On Sun, 2008-01-27 at 14:30 -0800, Don Stewart wrote:
brian.sniffen:
On Jan
Doubling up an announcement email again to reduce the traffic on the
list. First:
RPCA is an RPC system. This first release is pretty lacking, simple
client-server interactions work but there's no lame-duck handling,
load balancing, security etc. RPCA uses codec-libevent's tagged data
structures
On Sun, 2008-01-27 at 17:25 -0500, Brian Sniffen wrote:
On Jan 27, 2008 3:49 AM, Bulat Ziganshin [EMAIL PROTECTED] wrote:
a few months ago i
have a conversation with today student and they still learn Lisp (!!!).
it seems that they will switch to more modern FP languages no earlier
that
Hello Jerzy and Bulat,
Thanks for your perspectives. Bulat, I can understand that you find it
shocking that the folks at Moscow University still study Lisp, but I
wouldn't be so quick to condemn them for being dinosaurs. After all, they
just stopped teaching the SICP course (using Scheme) at
Hello Hans,
Sunday, January 27, 2008, 5:02:57 PM, you wrote:
studied at Moscow University in 89-91 and department of computer
languages still studied Lisp at those times (!). a few months ago i
This reminds me, I worked at a Dutch telecomm software production
company for a short while in
The xmonad dev team is pleased to announce the 0.6 release of xmonad!
http://xmonad.org
xmonad is a tiling window manager for X. Windows are arranged
automatically to tile the screen without gaps or overlap, maximising
screen use. Window manager features are
Derek Elkins writes:
//Discussion about Lisp in Russia, some people not getting younger, Scheme
with types, and other bedlam//
No language that was ever popular has ever died as far as I can tell.
This is one of the persistent truths which has to be carefully
interpreted. Languages mutate
On Sun, 2008-01-27 at 12:54 -0800, Adam Langley wrote:
On Jan 27, 2008 12:24 PM, Don Stewart [EMAIL PROTECTED] wrote:
It should be possible to specify that your lib depends on exactly
0.9.0.1 in the .cabal file.
In the same general area. When you upgrade something like bytestring
and
G'day all.
Quoting [EMAIL PROTECTED]:
Algol is dead. No
sense in disputing it.
And yet Delphi is still alive. So is Modula-3, though it tends to be
referred to as Java these days.
And, of course, Haskell is ensuring that Miranda will never really die.
Cheers,
Andrew Bromage
On Jan27, Dipankar Ray wrote:
What I mean by this is that if I look at the CS programs at Berkeley, MIT,
CMU, I don't see a huge emphasis on PL. Looking now at the MIT
opencourseware offerings in EECS, I see no undergrad course that suggests
that you'd learn anything about modern type
On 1/27/08, Dipankar Ray [EMAIL PROTECTED] wrote:
Hello Jerzy and Bulat,
Thanks for your perspectives. Bulat, I can understand that you find it
shocking that the folks at Moscow University still study Lisp, but I
wouldn't be so quick to condemn them for being dinosaurs. After all, they
just
thanks for the correction - very informative! that'll teach me to just go
to the opencourseware site at MIT only...
On Sun, 27 Jan 2008, Dan Licata wrote:
On Jan27, Dipankar Ray wrote:
What I mean by this is that if I look at the CS programs at Berkeley, MIT,
CMU, I don't see a huge
After some fooling around, I came up with something I think makes
sense. Let me know if this is the right/wrong thing. It seems to
work for the examples I've tried so far.
instance (Floating f, MetricSpace e f
,MetricSpace e' f, HZip l l (HCons (e', e') l')
,HFoldr
Hi,
How do you organize code ?
Here is a sample.
Acturally, I am thinking about using this plan.
Any suggestions ?
-- BasicalType.hs
type Position = (Int,Int)
data Box = Box { pos :: Position }
data Chain = Chain { pos :: [Position] }
-- Object.hs
import BasicalType
class Object o
On 1/27/08, L.Guo [EMAIL PROTECTED] wrote:
Hi,
How do you organize code ?
Here is a sample.
Acturally, I am thinking about using this plan.
Any suggestions ?
-- BasicalType.hs
type Position = (Int,Int)
data Box = Box { pos :: Position }
data Chain = Chain { pos :: [Position] }
On Sun, 27 Jan 2008, Bulat Ziganshin wrote:
Hello Hans,
Sunday, January 27, 2008, 5:02:57 PM, you wrote:
This reminds me, I worked at a Dutch telecomm software production
company for a short while in 1999 and they had two Russian software
engineers there, one from St. Petersburg and
43 matches
Mail list logo
