On Sun, Apr 21, 2013 at 9:25 PM, Donn Cave d...@avvanta.com wrote:
Quoth Evan Laforge qdun...@gmail.com,
sleep = Process.createProcess (Process.proc sleep [5])
sleep = Process.createProcess
((Process.proc sleep [5]) {Process.close_fds = True})
- Because the client uses buffered
So, if I understand correctly, you're using the online/offline
criterion to resolve non-directed cycles in pipelines? (I couldn't
tell how the Shivers paper was related.)
Cheers,
Edward
Excerpts from Ben Lippmeier's message of Sun Apr 21 19:29:29 -0700 2013:
On 22/04/2013, at 12:23 , Edward
When I was writing
http://www.vex.net/~trebla/haskell/crossroad.xhtml
I wanted to write: branching on predicates and then using selectors is
less efficient than pattern matching, since selectors repeat the tests
already done by predicates.
It is only ethical to verify this claim before
Note that, unfortunately, GHC's exhaustiveness checker is *not* good
enough to figure out that your predicates are covering. :o) Perhaps
there is an improvement to be had here.
Edward
Excerpts from Albert Y. C. Lai's message of Mon Apr 22 00:51:46 -0700 2013:
When I was writing
* Evan Laforge qdun...@gmail.com [2013-04-22 12:41:33+0530]
On Sun, Apr 21, 2013 at 9:25 PM, Donn Cave d...@avvanta.com wrote:
Quoth Evan Laforge qdun...@gmail.com,
sleep = Process.createProcess (Process.proc sleep [5])
sleep = Process.createProcess
((Process.proc sleep [5])
[Apologies if you receive multiple copies of this CFP]
===
CALL FOR PAPERS
17th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES
BrasÃlia, Distrito Federal, Brazil
September 29th to October 4th, 2013
http://cbsoft2013.unb.br/en/sblp-en
quoth Evan Laforge qdun...@gmail.com,
...
Oh I see, because the subprocess inherits the socket connection. That
makes sense, though it's tricky. Tricky tricky unix. Why does fork()
have to be so complicated?
Well, it's very elegant really. It's one of the tools UNIX gives
you to decompose
Hello again,
I forgot to ask if I need to find myself a mentor or one will be
assigned to me by haskell.org?
Many thanks,
Bastien
On 4/21/13 5:57 PM, Bastien Jacot-Guillarmod wrote:
Hello,
I'm interested in doing some improvments on the Yi editor for my Google
summer of code by
Hi everyone!
For some reason, this leaks thunks:
module Main where
import Control.Monad
import Control.Monad.MC -- from monte-carlo
import Control.Monad.ST.Strict
go :: Int - MCT (ST s) ()
go k = replicateM_ k (return ())
main = print $ runST $ evalMCT (go 1) rng
where
rng
Hi Eric,
On Sun, Apr 14, 2013 at 10:57:43AM -0700, Eric Dobson wrote:
I am working at reimplementing the library Unbound to understand how
it works. One issue I have come up with is that an equation that I
thought held true doesn't. The equation is: Forall e::Rebind a b, e
`aeq` (uncurry
More interestingly, the problem goes away if I enable profiling. That's
kind of worrisome.
- Clark
On Monday, April 22, 2013, Clark Gaebel wrote:
Hi everyone!
For some reason, this leaks thunks:
module Main where
import Control.Monad
import Control.Monad.MC -- from monte-carlo
import
Hi,
Am Montag, den 22.04.2013, 16:44 -0400 schrieb Clark Gaebel:
More interestingly, the problem goes away if I enable profiling.
That's kind of worrisome.
this part sounds similar than the recently discussed problem with the
ackermann function (http://hackage.haskell.org/trac/ghc/ticket/7850)
I don't have a copy of GHC HEAD handy, and don't have the time to set up
the ecosystem myself to test this one bug.
Would someone else with a copy lying around mind testing it out for me?
Thanks,
- Clark
On Monday, April 22, 2013, Joachim Breitner wrote:
Hi,
Am Montag, den 22.04.2013,
On 22/04/2013, at 5:27 PM, Edward Z. Yang wrote:
So, if I understand correctly, you're using the online/offline
criterion to resolve non-directed cycles in pipelines? (I couldn't
tell how the Shivers paper was related.)
The online criteria guarantees that the stream operator does not need
I'm pleased to announce the initial release of Robot!
Robot lets you send fake keyboard and mouse events, just like its
namesake in Java.
Only X11 systems are supported right now (via XTest), but Windows and
Mac can be added later if anyone cares.
## Features
+ Simple API (only 9 functions
Hi Ian,
I have a couple of questions for you -
1. Could you explain why a lambda calculus like language embedded in
Haskell would be useful - I ask this because, the way I understand, Haskell
is already such a language - one could easily chose to restrict oneself to
just function definition and
I'm using netwire to make a top-down shooter; the player can spawn projectiles
by clicking, and projectiles will destroy themselves and whatever they hit on
collisions. So the way I'm thinking of this is as a collection of wires, one
for each projectile, that I can cast input events to;
On Mon, Apr 22, 2013 at 7:39 PM, Donn Cave d...@avvanta.com wrote:
quoth Evan Laforge qdun...@gmail.com,
...
Oh I see, because the subprocess inherits the socket connection. That
makes sense, though it's tricky. Tricky tricky unix. Why does fork()
have to be so complicated?
Well, it's
I'm pleased to announce the first release of ipopt-hs. This package is
a binding to a software package for large-scale nonlinear optimization
https://projects.coin-or.org/Ipopt. You can get it from hackage:
http://hackage.haskell.org/package/ipopt-hs
Or if the documentation doesn't build (since
Where I am making the type error (that cannot be caught)? I would
assume it would be the 'let substed = subst x (Var y) rebound', line
in particular the third argument. But the documentation of subst does
not use either t or p in its type signature, so the rule doesn't seem
to apply [1]. And I
20 matches
Mail list logo
