quoth Evan Laforge qdun...@gmail.com,
...
and it still waits for the subprocess to complete. Actually, it looks
like it's the client's hGetContents, since hGetChar comes back
immediately. I guess that's understandable, but even hGetLine blocks.
In the version I was looking at, if I change
I tested it on GHC 6.12.1, which wasn't affected by the recent ackermann
bug, but still it leaks memory.
Petr Pudlak
2013/4/22 Clark Gaebel cgae...@uwaterloo.ca
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
On Tue, Apr 23, 2013 at 09:36:04AM +0200, Petr Pudlák wrote:
I tested it on GHC 6.12.1, which wasn't affected by the recent ackermann
bug, but still it leaks memory.
I tested it on GHC 7.4.1 and I don't see any space leak.
___
Haskell-Cafe mailing
In GHC User's Guide, the reason to disable TemplateHaskell is as
follows:
TemplateHaskell — Is particularly dangerous, as it can cause side
effects even at compilation time and can be used to access
constructors of abstract data types.
Doesn't the same apply to quasi-quotes?
Can anyone tell me why I get a type error with testGrad2? What are my options?
Clearly I would like to be able find the gradient of my cost function for
different sets of observations.
Thanks, Dominic.
{-# LANGUAGE NoMonomorphismRestriction #-}
import Numeric.AD
default()
costFn ::
Hi
I ever was worried about the barrier that the complexity of the Haskell
errors impose to users of DSLs. Many DSLs look so simple that even someone
without knowledge of Haskell can make use of them for some domains.
However when the program is compiled then al the monsters of the
deep appear
Answering my own question, what I needed was:
testGrad2 :: (Fractional a, Num a) =
(forall s . Mode s = [AD s a]) -
(forall s . Mode s = [[AD s a]]) -
[a] - [a]
testGrad2 ys xss = grad (costFn ys xss)
On 23 Apr 2013, at 10:44, Dominic Steinitz
Hi everyone,
I am experimenting with various implementation styles for classical FRP. My
current thoughts are on a continuation-style push implementation, which can be
summarized as follows.
newtype EventT m r a= E { runE :: (a - m r) - m r - m r }
newtype ReactiveT m r a = R { runR ::
I'm on 7.6.2, and it does. Oh no.
- Clark
On Tuesday, April 23, 2013, Tom Ellis wrote:
On Tue, Apr 23, 2013 at 09:36:04AM +0200, Petr Pudlák wrote:
I tested it on GHC 6.12.1, which wasn't affected by the recent
ackermann
bug, but still it leaks memory.
I tested it on GHC 7.4.1 and I
I'm probably not the best person to answer your questions but here is a try:
I refer to my language as a mini language because I'm only showing lamda,
application and extension. You might choose to add other features like
symbol definitions, fixed points, pattern matching etc. which in the more
Generally, for a successful proposal you need to already find someone
who is willing to mentor the project.
Honestly, I do not think working on Yi would make for a very strong
proposal. It is definitely a cool piece of software, and definitely
worth working on, but it does not have a very large
On Tue, Apr 23, 2013 at 12:49:59PM +0200, Alberto G. Corona wrote:
Hi
I ever was worried about the barrier that the complexity of the Haskell
errors impose to users of DSLs. Many DSLs look so simple that even someone
without knowledge of Haskell can make use of them for some domains.
Helium - Utrecht University's simplified Haskell - had scriptable
Type inference directives so the creator of an EDSL was able to
augment the type checker to provide better error messages, see:
Scripting the Type Inference Process
Bastiaan Heeren Jurriaan Hage S. Doaitse Swierstra
Since the release of `pipes-network`, I've been encouraged to move the
non-pipes-related TCP utilities to their own package, so I've done
that, and `network-simple` is the result.
This package builds on top of the great `network` package available in
The Haskell Platform, and aims to simplify the
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Greetings,
In light of fairly recent discussion, on this mailing list, I decided
to investigate the topic of Markdown support for Haddock. The archives
of the recent discussion can be seen at [1]. This post aims to
summarise the current state of
Stephen
The paper is very interesting. We need something like that:
... As a result, the beginning programmer is likely to be discouraged from
pro-gramming in a functional language, and may see the rejection of
programs as a nuisance instead of a blessing. The experienced user might
not look at
Hi. I have ghc-7.6.3 and alex-3.0.5.
When I build https://github.com/jwaldmann/smt-lib
it breaks with Language/SMTLIB/Lexer.x:6:5: Not in scope: `alexAndPred'.
It was working with alex-2.3.5.
I was going t add Can I constrain the alex version in the
cabal file (I recall this is difficult for
All,
I have recently released new versions of:
- crypto-api[1]: An interface for cryptographic algorithms such as
block ciphers, hashes, and secure random number generators. This
version includes Klondike's cbcMac and SIV modes of operation - much
thanks to his numerous patches.
- DRBG[2]: A
Hi Hans,
Do you have a denotation for your representation (a specification for your
implementation)? If so, it will likely guide you to exactly the right type
class instances, via the principle of type class
morphismshttp://conal.net/papers/type-class-morphisms/(TCMs). If you
don't have a
19 matches
Mail list logo
