#445: panic! mkWWcpr: not a product
---+
Reporter: nobody| Owner: simonpj
Type: bug | Status: new
Priority: normal| Milestone:
Component: Compiler |
Hello Simon
i'm now write some sort of new i/o library. one area where i currently
lacks in comparision to the existing Handles implementation in GHC, is
the asynchronous i/o operations. can you please briefly describe how
this is done in GHC and partially - why the multiple buffers are used?
On 27.01 13:10, Bulat Ziganshin wrote:
i'm now write some sort of new i/o library. one area where i currently
lacks in comparision to the existing Handles implementation in GHC, is
the asynchronous i/o operations. can you please briefly describe how
this is done in GHC and partially - why the
I just installed the Darwin Ports ghc-devel package, which grabs the
latest from the darcs repository. It seems to build fine, but when I
run ghci it seems to run and work (as far as I've tested) just fine
except that it beeps continuously. Any ideas?
Hello Einar,
Friday, January 27, 2006, 4:19:55 PM, you wrote:
EK One simple optimization is that you can omit all buffering with
EK unbuffered operation. Then simply add the buffer (which is ok
EK because Handles are mutable) if the user ever calls hLookAhead.
yes, i do it
moreover, i have an
Hello Duncan,
Friday, January 27, 2006, 4:00:28 PM, you wrote:
moreover, i have an idea how to implement async i/o without complex
burecreacy: use mmapped files, may be together with miltiple buffers.
for example, we can allocate four 16kb buffers. when one buffer is
filled with written
Bulat Ziganshin wrote:
i'm now write some sort of new i/o library. one area where i currently
lacks in comparision to the existing Handles implementation in GHC, is
the asynchronous i/o operations. can you please briefly describe how
this is done in GHC and partially - why the multiple buffers
I added this to the FAQ list; please feel free to elaborate and correct.
Linking to Visual Studio-generated code would be much easier if GHC were
able
to use Visual C++ as backend, instead of gcc (even Visual Haskell at the
moment
relies on gcc for C compilation).
I have no idea, though, how
I used Haskell to implement a kind of scripting language, and it seemed most
usable to me.
I particular, I liked the fact that it was possible to write a Parsec parser
that compiles script language expressions directly into executable Haskell
functions, avoiding the need for a separate
Jules,
If you're looking for a text on implementing interpreters using functional programming languages, Essentials of Programming Languages by Friedman et al. is a good start. It uses Scheme instead of Haskell, but it might be helpful when you're reading Haskell code, like samples that come with
Hello,
the names of the pages of the new MediaWiki-driven Haskell wiki are often
rather directory names than article titles as they are on Wikipedia. For
example, the page Books and tutorials about Haskell isn't named Books and
tutorials about Haskell or Books and tutorials but just Books.
Wolfgang Jeltsch wrote:
Hello,
the names of the pages of the new MediaWiki-driven Haskell wiki are often
rather directory names than article titles as they are on Wikipedia. For
example, the page Books and tutorials about Haskell isn't named Books and
tutorials about Haskell or Books and
Am Freitag, 27. Januar 2006 20:44 schrieb Ashley Yakeley:
[...]
I don't mind people creating hierarchies such as Simon M's performance
resource. It may not be appropriate for a pure encyclopedia like
Wikipedia, but HaskellWiki will be replacing the haskell.org site
(shortly) and a more
Am Freitag, 27. Januar 2006 19:54 schrieb John Peterson:
You're absolutely right! Please move pages as needed. Old habits die
hard!
John
Hello,
I just started moving pages. But know I wonder which case I should use for
inner-title words. Should the page title be Books and tutorials or
Wolfgang Jeltsch wrote:
I just started moving pages. But know I wonder which case I should use for
inner-title words. Should the page title be Books and tutorials or Books
and Tutorials, for example? Since pages are only small documents, I chose
the lower-case alternative but currently the
Thanks, everyone, for the kind responses.I will read Yet Another Haskell Tutorial first, and then I am going to study All About Monads, and maybe a textbook (or more basic Haskell) after that.Thanks again, the Haskell community is very helpful!
Jules
___
Sam Goldman wrote:
Wolfgang Jeltsch wrote:
I just started moving pages. But know I wonder which case I should
use for inner-title words. Should the page title be Books and
tutorials or Books and Tutorials, for example? Since pages are
only small documents, I chose the lower-case
On 27.01 21:13, Wolfgang Jeltsch wrote:
I don't mind people creating hierarchies such as Simon M's performance
resource. It may not be appropriate for a pure encyclopedia like
Wikipedia, but HaskellWiki will be replacing the haskell.org site
(shortly) and a more hierarchical structure may
S.J.Thompson wrote:
Johannes - thanks for the pointer to this posting; would you have a
concrete proposal to make on the basis of this for Haskell'?
Sort of an idea, but not fully worked out.
Referring to
http://www.haskell.org//pipermail/haskell-cafe/2005-June/010516.html
I think I want to
On 26 January 2006 16:07, John Hughes wrote:
Simon Marlow wrote:
I wonder if there's an alternative solution along these lines:
- We use ParialTypeSignatures to make bindings monomorphic:
http://haskell.galois.com/cgi-bin/haskell-prime/trac.cgi/wiki/PartialTyp
eSigs
eg.
Personally I think ~ patterns are great, and we are now talking about !
patterns, a kind of dual to ~ patterns. So at least I think we should
un-couple the two discussions.
I think so too. Removing ~ patterns seems like a fairly poor idea to
me. Sure, they're not very much explicitly
On 1/26/06, Aaron Denney [EMAIL PROTECTED] wrote:
On 2006-01-26, Dinko Tenev [EMAIL PROTECTED] wrote:
On 1/26/06, Conor McBride [EMAIL PROTECTED] wrote:
[...]
We'd do daft stuff like
(200 * _ ^ 2) unitsquare
Yes, I played with a concept like that at one point, and came to the
On Fri, Jan 27, 2006 at 01:30:02PM +, S.M.Kahrs wrote:
It doesn't have a ticket yet,
but I would propose that kind annotations were adapted.
I have been bitten on a couple of occasions (working with HO type variables)
by kind inference putting my type vars into *, and although there is
One aspect of this discussion I've yet to see that I think is
important is, how do the various proposals for removal/modifications
of M-R impact implicit parameters? Are implicit parameters likely to
be in Haskell'? It seems like the proposal to default to polymorphic
binding and have
John Meacham wrote:
On Fri, Jan 27, 2006 at 12:28:23PM +1100, Donald Bruce Stewart wrote:
john:
I have often wanted a shorthand syntax for testing if a value
matches a given pattern. I want to implement such an extension for
jhc but can't decide an appropriate syntax so I thought I'd ask the
On 27/01/06, Brian Hulley [EMAIL PROTECTED] wrote:
John Meacham wrote:
On Fri, Jan 27, 2006 at 12:28:23PM +1100, Donald Bruce Stewart wrote:
john:
I have often wanted a shorthand syntax for testing if a value
matches a given pattern. I want to implement such an extension for
jhc but
Hi -
To avoid the problems with so many names being put into a module's
namespace, data declarations could implicitly define sub-modules and
class/instance declarations as follows:
module M where
data Foo = FooCon {x : Int}
would declare (as seen from inside M)
Foo, Foo.FooCon,
Apologies - I've noticed some mistakes corrected as follows:
Brian Hulley wrote:
class //x a b where
x : a - b
class //FooCon a b where
FooCon : a - b
class //x a b | a - b where-- I think this fundep is
correct
x :: a-b
Joel Koerwer wrote:
On 1/26/06, *Donald Bruce Stewart* [EMAIL PROTECTED]
mailto:[EMAIL PROTECTED] wrote:
Ah, i just do: ghc A.hs -O2 -ddump-simpl | less
and then read the Core, keeping an eye on the functions I'm interested
in, and checking they're compiling to the kind of
Another correction...
Brian Hulley wrote:
data Col1 a = One a
data Col2 a = One a | Two a
useOne :: ( //One col a) = col - a
useOne (One x) = x
should be
useOne :: (//One a col) = col - a
___
Haskell-Cafe
Dear
Haskellers,
since this is my
first post,
"Hello all"
I have a problem
with a function taken from class Arrow.
arr :: (b - c) - a b c
To build my own
arrow, i need to distinguish between different kinds of b or
c.
For instance, if
bhas the form(d,e), i want to construct
Hi Sven,
since this is my first post,
Hello all
Welcome!
I have a problem with a function taken from class Arrow.
arr :: (b - c) - a b c
To build my own arrow, i need to distinguish between different kinds
of b or c. For instance, if b has the form (d,e), i want to construct
On Fri, Jan 27, 2006 at 08:20:07PM +0100, Sven Biedermann wrote:
I have a problem with a function taken from class Arrow.
arr :: (b - c) - a b c
To build my own arrow, i need to distinguish between different kinds
of
b or c.
For instance, if b has the form (d,e), i want to
Haskell beginner using GHC.
I have a function to do some simple arithmetic at run time:
myeval :: Int - Int - String - Int
myeval x y + = (+) x y
myeval x y - = (-) x y
myeval x y * = (*) x y
-- ...
While that works, I'm curious to know if it can be done more
elegantly. I'm thinking of
Andrew Savige wrote:
Haskell beginner using GHC.
Hello there!
How about,
opTable
= [ (+, (+))
, (-, (-)) ... ]
myeval x y op
= let Just fun = lookup op opTable
in x `fun` y
?
I have a function to do some simple arithmetic at run time:
myeval :: Int - Int - String - Int
BTW: There isn't an easy way to magically derive opTable. We're relying
on the fact that these simple functions all have the same type.
Ben Lippmeier wrote:
opTable
= [ (+, (+))
, (-, (-)) ... ]
myeval x y op
= letJust fun = lookup op opTable
in x `fun` y
You could also
On 28/01/06, Andrew Savige [EMAIL PROTECTED] wrote:
Haskell beginner using GHC.
I have a function to do some simple arithmetic at run time:
myeval :: Int - Int - String - Int
myeval x y + = (+) x y
myeval x y - = (-) x y
myeval x y * = (*) x y
-- ...
While that works, I'm curious to
37 matches
Mail list logo
