#1593: runInteractiveProcess misbehaves when it gets invalid (eg. non-existent)
working directory parameter
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug|
#1594: Better QuickCheck/HUnit integration
+---
Reporter: igloo | Owner:
Type: feature request| Status: new
Priority: normal | Milestone:
#1595: duplicate not in scope error when giving multiple vars type-signatures
at
once
---+
Reporter: Isaac Dupree | Owner:
Type: bug | Status: new
Priority: normal
#1596: ghc-pkg --define-name is undocumented
--+-
Reporter: eivuokko | Owner:
Type: feature request | Status: new
Priority: low | Milestone:
#1593: runInteractiveProcess misbehaves when it gets invalid (eg. non-existent)
working directory parameter
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug|
#1597: OpenGL: Bindings for GLE library?
+---
Reporter: igloo | Owner:
Type: bug| Status: new
Priority: normal | Milestone: Not GHC
#1594: Better QuickCheck/HUnit integration
--+-
Reporter: igloo |Owner:
Type: feature request| Status: new
Priority: normal |Milestone: Not GHC
#1598: Could instances of Typeable, Data be added?
+---
Reporter: igloo | Owner: [EMAIL PROTECTED]
Type: feature request| Status: new
Priority: normal
#1598: Could instances of Typeable, Data be added?
--+-
Reporter: igloo |Owner: [EMAIL PROTECTED]
Type: feature request| Status: new
Priority: normal
Hi Simon,
OK this is an interesting one. Here's the smallest program that demonstrates
the problem.
foreign import ccall unsafe stdio.h getchar getchar :: IO CInt
f56 :: State# RealWorld - Int - Int
f56 s v2 = case (unIO getchar s) of
(# s' , v6 #) -
case v2 of
Simon Peyton-Jones wrote:
| I've got an inner loop that I think I can see is strict in the Int
| argument being passed around, but that GHC 6.6.1 isn't unboxing. In the
| following example both functions take a GHC.Base.Int, which I think
| should be an Int#.
OK this is an interesting one.
---
Haskell Weekly News
http://sequence.complete.org/hwn/20070807
Issue 64 - August 07, 2007
---
Welcome to issue 64 of HWN, a weekly newsletter
Hi all
I am trying to use the summer of code version of haddock, which I got
from the Darcs repository.
I have two files:
Bar.hs:
module Bar where
-- |Some comment
bar :: Int
bar = 2
and Foo.hs:
module Foo where
import Bar
Hi Mads,
I have fixed this in my local repo. I will push the patch later today when
I'm home. The bug was due to a change in the GHC API.
/David
Hi all
I am trying to use the summer of code version of haddock, which I got
from the Darcs repository.
I have two files:
Bar.hs:
In class Integral, divMod has a default in terms of quotRem.
(quot,rem,div,mod all have defaults as the both-function they're part
of.) I'm sure divMod is more natural than quotRem to implement for some
types... so why doesn't quotRem have a default in terms of divMod? it
has no default! Then
Hi,
Really interested in doing a phd on threading. Any ideas how I'd go about
doing/applying for that? Basically, threading seems to be the cutting-edge
right out (for a while) as processor frequencies top out, and multicores
increase.
I dont have any formal CS training, but I do have a degree
If you also read the rest of that thread, you'll see that with a recent
GHC HEAD, you should be able to avoid the need for the Teq witness.
http://www.cs.chalmers.se/~rjmh/Papers/restricted-datatypes.ps
here is solution which doesn't require GADT and HEAD, but it does
require changing of
I am working on a parallel brute-force solver, which will be tested on
25x25 puzzles (my current serial solver requires less than 1 second for
the most difficult 9x9 puzzles I've been able to find; while I haven't
tried it on 16x16 puzzles on one of the machines in the Brooklyn College
On 8/7/07, Murray Gross [EMAIL PROTECTED] wrote:
I am working on a parallel brute-force solver, which will be tested on
25x25 puzzles (my current serial solver requires less than 1 second for
the most difficult 9x9 puzzles I've been able to find; while I haven't
tried it on 16x16 puzzles on
---
Haskell Weekly News
http://sequence.complete.org/hwn/20070807
Issue 64 - August 07, 2007
---
Welcome to issue 64 of HWN, a weekly newsletter
On 8/7/07, Hugh Perkins [EMAIL PROTECTED] wrote:
Question: what do you mean by, for example 25x25? Do you mean grids with
a total length of 25 on each side, eg:
(because on my super-dooper 1.66GHz Celeron, generating 10 random 25x25
grids such as the one above takes about 1.01 seconds;
Hi, there's something I'm trying to do with type classes that seems to fit very
naturally with my mental model of type classes, but doesn't seem to be
supported by the language. I'm wondering whether I'm missing something, or
whether there's some language extension that could help me or
DavidA wrote:
newtype Lex = Lex Monomial deriving (Eq)
newtype Glex = Glex Monomial deriving (Eq)
Now, what I'd like to do is have Lex and Glex, and any further monomial
orderings I define later, automatically derive Show and Num instances from
Monomial (because it seems like boilerplate
On Tue, 2007-08-07 at 12:58 +, DavidA wrote:
Hi, there's something I'm trying to do with type classes that seems to fit
very
naturally with my mental model of type classes, but doesn't seem to be
supported by the language. I'm wondering whether I'm missing something, or
whether
DavidA wrote:
Now, what I'd like to do is have Lex and Glex, and any further monomial
orderings I define later, automatically derive Show and Num instances from
Monomial (because it seems like boilerplate to have to define Show and Num
instances by hand). Something like the following (not
On 8/5/07, Frank Buss [EMAIL PROTECTED] wrote:
Nearly anything works without thinking too much about the types, but I
don't like the use of fromInteger in the average and main functions. Is it
possible that the integers are automaticly converted to floats?
I recommend using Float or Double
Hi Conal,
I've tried some links, e.g. the pre-compiled components from
http://conal.net/Pan/Releases/2000-12-06/ or the interactive presentation
from http://conal.net/Pan/papers.htm , but file not found. Do you have the
files? Would be easier than trying to setup Haskell and Visual C++
On Tuesday 07 August 2007 21:22:00 Frank Buss wrote:
I assume to make it fast, a good idea would be to cache some calculations...
If you want to make it fast you should be using hardware acceleration.
--
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
OCaml for Scientists
Yes, by 25x25 puzzles I mean sudoku puzzles with 25 cells on each side,
with the smaller squares being 5x5 (i.e., we need to construct rows with
the numbers 1-25, and the smaller squares must each contain all of the
numbers 1-25).
Murray Gross
Brooklyn College
On Tue, 7 Aug 2007, Hugh
I agree with Jon. And hardware acceleration is in tension with the
generality of the extreme generality of formulating images as general
(computable) functions on space (and hence arbitrary non-linear
transformations, etc).
*Unless*, you abandon the traditional acceleration of a fixed set of 2D
Hi Frank,
Pan has been bit-rotten for a while now. Besides the unfortunate dependency
on Visual C++, it used a now long-obsolete GUI library. That's one reason I
started working on Pajama (http://conal.net/Pajama).
There's no reason not to create modern, cross-platform successors to
Pan/Pajama
On 8/8/07, Conal Elliott [EMAIL PROTECTED] wrote:
*Unless*, you abandon the traditional acceleration of a fixed set of 2D
(or 3D) primitives and transformations and instead compile into graphics
processor code as in http://conal.net/Vertigo .
Wow, cool :-)
32 matches
Mail list logo
