#1541: No way at all to set fixity for infix operators defined in template
haskell
-+--
Reporter: guest |Owner:
Type: bug | Status: new
Priority: normal
#1330: Impredicativity bug: Church2 test gives a rather confusing error with the
HEAD
+---
Reporter: igloo|Owner: simonpj
Type: bug | Status: new
#1522: Make [n..] etc syntax rebindable
+---
Reporter: guest|Owner: simonpj
Type: feature request | Status: new
Priority: normal |Milestone: 6.10
#1571: type of synthesize in Data.Generics.Schemes is too restrictive
--+-
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority:
| I was wondering why we don't have an annotation or pragma for function to tell
| the compiler that we _need_ this particular recursive function to be unfolded.
| If the compiler cannot do this for some reason it should produce an error
| message to help you modifying your code. I have regularly
Hello Simon,
Tuesday, July 31, 2007, 1:22:14 PM, you wrote:
GHC never inlines recursive functions. Why not? Because doing so
exposes a new inline opportunity. How many times would you like it inlined?
Not forever, I assume!
really, state of things in this area is not pleasant. making
Hi all!.
I modified build.mk in order to allow Ticky-Ticky profiling (GhcLibWays=t).
Now, when I try to make I get this error:
== make way=t all;
PWD = (the_whole_path)/ghc-6.6.1/rts
| However my point was more on a semantic point of view: If I write a function
| in a recursive way, but actually do nothing else than a loop, I would like
| a) that the compiler unrolls it to a loop and
| b) that I can specify such a requirement, while violating it emits an error.
What does it
On Jul 31, 2007, at 10:20 AM, Simon Peyton-Jones wrote:
| However my point was more on a semantic point of view: If I write
a function
| in a recursive way, but actually do nothing else than a loop, I
would like
| a) that the compiler unrolls it to a loop and
| b) that I can specify such a
On Tue, 2007-07-31 at 10:36 -0400, Jan-Willem Maessen wrote:
I think what's meant here is translating something like this:
{-# INLINE f #-}
f x y z = ... f x' y' z' ...
into this:
{-# INLINE f #-}
f x y z = f' x y z
where f' x y z = ... f' x' y' z' ...
That is, shoving (all
| {-# INLINE f #-}
| f x y z = ... f x' y' z' ...
|
| into this:
|
| {-# INLINE f #-}
| f x y z = f' x y z
| where f' x y z = ... f' x' y' z' ...
|
| That is, shoving (all of) the recursion in a level. Then inlining f
| results in a fresh loop, which presumably can be specialized
On 7/31/07, Cristian Perfumo [EMAIL PROTECTED] wrote:
Hi all!.
I modified build.mk in order to allow Ticky-Ticky profiling (GhcLibWays=t).
Now, when I try to make I get this error:
== make way=t all;
PWD =
Tim Griffin is advertising a 3-year research associate position at the
Cambridge Computer Lab, working on a project that seeks to design and implement
a meta-language for the specification and implementation of correct Internet
routing protocols.
He says A PL person would be perfect.
Details
I keep running into situations in which I want more powerful search in
selecting type class instances. One example I raised in June, in which all
of the following instances are useful.
instance (Functor g, Functor f) = Functor (O g f) where
fmap h (O gf) = O (fmap (fmap h) gf)
instance
Conal Elliott [EMAIL PROTECTED] wrote in article [EMAIL PROTECTED] in
gmane.comp.lang.haskell.general:
I keep running into situations in which I want more powerful search in
selecting type class instances.
I agree that it's quite useful for instance search to backtrack, if not
desirable in all
Here are some other instances that could work with backward chaining:
\begin{code}
instance Monad m = Applicative m where
pure = return
(*) = ap
instance (Applicative f, Monoid a) = Monoid (f a) where
mempty = pure mempty
mappend = liftA2 mappend
instance (Applicative f, Num a) =
Thanks for these pointers, Ken. And belated thanks to Oleg for his reply in
June. Impressive tricks!
Perhaps I'm not the only person who'd prefer a more straightforward
formulation of backtracking search? Cheers,
- Conal
On 7/31/07, Chung-chieh Shan [EMAIL PROTECTED] wrote:
Conal Elliott
Hello,
My understanding is that this sort of instance collection doesn't work
together because instance selection is based only on the matching the head
of an instance declaration (part after the =). I'm wondering why not use
the preconditions as well, via a Prolog-like, backward-chaining
The code in Bananas in Space: Extending Fold and Unfold to Exponential Types
http://citeseer.ist.psu.edu/293490.html
mirror:
http://www.cs.nott.ac.uk/~gmh/bananas.pdf
uses Gofer, and has examples such as
data Rec f = In (f (Rec f))
type P f a = f (Rec f, a)
mapP :: Functor f = (a - b) - P f a
Jim Apple wrote:
data Rec f = In (f (Rec f))
type P f a = f (Rec f, a)
mapP :: Functor f = (a - b) - P f a - P f b
mapP g = fmap (\(x,a) - (x, g a))
instance Functor f = Functor (P f) where
fmap = mapP
Why did Gofer have this power while Haskell does not?
Haskell does have the same
Chad Scherrer wrote:
I prefer the purely functional approach as well, but I've
been bitten several times by laziness causing space leaks in this
context. I'm on a bit of a time crunch for this, so I avoided the
risk.
Well, space leaks won't magically disappear if you use IO a .
Regards,
| On the other hand, it's not entirely true that there's no standard
| library, it's just that it's borders are slightly fuzzy. For example, we
| do have the library change submission process for modifying the standard
| libraries. Up until now that has been taken to mean changes to the base
|
Hey Haskell-Cafe,
I was trying out the code in Dons's article [1], and I noticed a
weird thing when doing it in GHCi. When binding the function
composition to a variable, the type suddenly changes. I'm not
completely sure why this happens. Is this because GHCi is in a monad
and wants to
Chris Eidhof wrote:
When binding the function composition to a variable, the type
suddenly changes.
Prelude Control.Arrow List :t map (length head) . group
map (length head) . group :: (Eq a) = [a] - [(Int, a)]
Prelude Control.Arrow List let encode = map (length head) . group
Prelude
* Simon Peyton-Jones wrote:
Then, in effect, the standard library is all the X packages. I wonder
if it'd help to have some descriptions such as those above (better
worded), and use them? Cabal already has a stability indication, and
that might serve, but we'd want to articulate much more
On Mon, 30 Jul 2007 00:56:30 +0200, John Goerzen [EMAIL PROTECTED]
wrote:
I have heard from a number of people that this behavior is not very
newbie-friendly. I can see how that is true. I have an API revision
coming anyway, so perhaps this is the time to referse the default
laziness of
On 31-jul-2007, at 11:38, Chris Eidhof wrote:
Hey Haskell-Cafe,
I was trying out the code in Dons's article [1], and I noticed a
weird thing when doing it in GHCi. When binding the function
composition to a variable, the type suddenly changes. I'm not
completely sure why this happens.
I'd like to add a #ifdef to Takusen's Setup.hs, so that we can have a
single source file that will compile with ghc-6.6 and ghc-6.6.1. With
ghc-6.6 and Cabal-1.1.6.1 we use splitFileName and joinPaths from
Distribution.Compat.FilePath. With ghc-6.6.1 (which includes
Cabal-1.1.6.2) these have been
On Tue, 2007-07-31 at 13:46 +0100, Bayley, Alistair wrote:
I'd like to add a #ifdef to Takusen's Setup.hs, so that we can have a
single source file that will compile with ghc-6.6 and ghc-6.6.1. With
ghc-6.6 and Cabal-1.1.6.1 we use splitFileName and joinPaths from
Distribution.Compat.FilePath.
On Tue, 2007-07-31 at 10:15 +0100, Simon Peyton-Jones wrote:
All true, but not so helpful for Joe User. For Joe, I think it might
be helpful to have some easily-discoverable notion of which package
quality and stability.
- Package X is blessed; lots of people have argued over its design,
Hello Duncan,
Tuesday, July 31, 2007, 5:06:35 PM, you wrote:
#ifdef __CABAL_VERSION__ 117
Is something like this possible with Cabal?
No, Cabal does not define any cpp defines like that.
фафшкб one of this year GSOC projects is Cabal sections
impelementation which should allow to make
Chris Smith wrote:
Can someone clarify what's going on with the standard library in
Haskell?
As of right now, I can download, say, GHC from haskell.org/ghc and get a
set of libraries with it. I can visit
http://haskell.org/ghc/docs/latest/html/libraries/, linked from the
haskell.org home
On Tue, 2007-07-31 at 17:20 +0400, Bulat Ziganshin wrote:
Hello Duncan,
Tuesday, July 31, 2007, 5:06:35 PM, you wrote:
#ifdef __CABAL_VERSION__ 117
Is something like this possible with Cabal?
No, Cabal does not define any cpp defines like that.
фафшкб one of this year GSOC
On 7/31/07, Chris Eidhof [EMAIL PROTECTED] wrote:
Hey Haskell-Cafe,
I was trying out the code in Dons's article [1], and I noticed a
weird thing when doing it in GHCi. When binding the function
composition to a variable, the type suddenly changes. I'm not
completely sure why this happens. Is
Bryan Burgers wrote:
On 7/30/07, peterv [EMAIL PROTECTED] wrote:
Does Haskell support any form of automatic memorization?
For example, does the function
iterate f x
which expands to
[x, f(x), f(f(x)), f(f(f(x))), …
gets slower and slower each iteration, or can it take
On Tue, 2007-07-31 at 10:15 +0100, Simon Peyton-Jones wrote:
- Package X is blessed; lots of people have argued over its design,
it's stable, widely used, and actively maintained. Changes to this
package goes through a quality-control process.
Then, in effect, the standard library is
Hi
Is there a good source for the operational semantics of Haskell? I am
trying to squeeze the most efficiency out of a bit of code and am looking to
remove unnecessary reductions.
You probably aren't after operational semantics - the compiler takes
your code and optimises it to something
On Tue, Jul 31, 2007 at 09:16:33AM -0600, Chris Smith wrote:
If there could be built-in quality control in promoting certain
packages, that would be great.
it needs to be more fine grained. a new version of a package may
indeed rollback some positive attributes (stability for example) that
a
| I see it as a really big deal that documentation becomes fragmented when
| one is using many packages, so that it's harder to find what you want.
| In fact, I'd classify that as the single biggest reason that I don't use
| many packages now
When you install packages A,B,C, the documentation for
On Tue, Jul 31, 2007 at 05:26:31PM +0100, Simon Peyton-Jones wrote:
| I see it as a really big deal that documentation becomes fragmented when
| one is using many packages, so that it's harder to find what you want.
| In fact, I'd classify that as the single biggest reason that I don't use
|
On Tue, 2007-07-31 at 17:26 +0100, Simon Peyton-Jones wrote:
| I see it as a really big deal that documentation becomes fragmented when
| one is using many packages, so that it's harder to find what you want.
| In fact, I'd classify that as the single biggest reason that I don't use
| many
Duncan Coutts [EMAIL PROTECTED] wrote:
What is missing from the local docs is a single integrated index page
that lists all the modules and then links off to the various packages's
docs like we have on the ghc website.
The problem with generating one of those is what manages it? What
The problem with generating one of those is what manages it? What
package would it belong to etc.
the same package that provides us with our interactive hackage prompt
rebuilding a central index will be a logical post-process for the
installation function
Hi Daniil,
oops -- i just noticed this response from you from weeks ago. i'm guessing
your question is all resolved for you by now. if not, please say so.
cheers, - Conal
On 6/25/07, Daniil Elovkov [EMAIL PROTECTED] wrote:
Hi Conal
2007/6/24, Conal Elliott [EMAIL PROTECTED]:
By
Having only a couple of days of practice programming Haskell (but having
read lots of books and docs), I find myself writing very explicit low level
code using inner aux functions (accumulators and loops). Then I force
myself to revise the code, replacing these aux functions with suitable
Thanks! Is this is also the case when using let and where, or is this just
syntactic sugar?
-Original Message-
From: Jules Bean [mailto:[EMAIL PROTECTED]
Sent: Tuesday, July 31, 2007 5:09 PM
To: Bryan Burgers
Cc: peterv; haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Newbie
On 31/07/07, peterv [EMAIL PROTECTED] wrote:
Having only a couple of days of practice programming Haskell (but having
read lots of books and docs), I find myself writing very explicit low level
code using inner aux functions (accumulators and loops). Then I force
myself to revise the
I've implemented KMP string searching for lazy bytestrings, and I'd
like some help improving the performance of the code. I'd also like to
know if it doesn't look correct - I've tested it pretty extensively
but you never know ...
I've been testing on a 7 MB file, where the search sequence is not
brad clawsie wrote:
i am having a problem with hxt, i was wondering if anyone here has
experience with it. in particular, i find that the xread function
chokes on xml files with xml declarations, and i am not sure why.
[...]
This is intended. Generally, wherever the HXT manual says content
No leak in sight.
-- Lennart
import Random
import Array
randomElts :: RandomGen g = g - [a] - [a]
randomElts _ [] = []
randomElts g xs = map (a!) rs
where a = listArray (1, n) xs
rs = randomRs (1, n) g
n = length xs
main = do
g - getStdGen
let xs = randomElts g
Ok, that looks good, but what if I need some random values elsewhere
in the program? This doesn't return a new generator (and it can't
because you never get to the end of the list). Without using IO or ST,
you'd have to thread the parameter by hand or use the State monad,
right? This is where I
On Jul 31, 2007, at 16:20 , Chad Scherrer wrote:
calls. I suppose a State' monad, strict in the state, could help here.
You mean Control.Monad.State.Strict ?
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] [EMAIL PROTECTED]
system administrator [openafs,heimdal,too many hats]
On 7/31/07, Brandon S. Allbery KF8NH [EMAIL PROTECTED] wrote:
On Jul 31, 2007, at 16:20 , Chad Scherrer wrote:
calls. I suppose a State' monad, strict in the state, could help here.
You mean Control.Monad.State.Strict ?
Umm, yeah, I guess I do. Glad I hadn't started recoding it!
Can anybody shout out about the latest version of ghc compatible with
building lambdabot?
http://www.cse.unsw.edu.au/~dons/lambdabot.html
shows it working on 6.4.1.
can it build under anything more recent?
t.
Stefan O'Rear [EMAIL PROTECTED]
Sent by: [EMAIL PROTECTED]
07/30/2007 11:59 PM
Stefan just got it working yesterday with ghc 6.6.1 and sent me the patch. I imagine it'll be in
the darcs repo soon if it isn't already.
Mike
Thomas Hartman wrote:
Can anybody shout out about the latest version of ghc compatible with
building lambdabot?
On Tue, Jul 31, 2007 at 04:46:30PM -0400, Thomas Hartman wrote:
Can anybody shout out about the latest version of ghc compatible with
building lambdabot?
http://www.cse.unsw.edu.au/~dons/lambdabot.html
shows it working on 6.4.1.
can it build under anything more recent?
It works under
Hello peterv,
Tuesday, July 31, 2007, 11:06:23 PM, you wrote:
it is property of explicit *name* given to result of some expression.
for example, when you write
f x = g (x*x) (x*x)
result of x*x isn't stored because it may be very large and compiler
exactly follows your instruction - calculate
in old glut, the main loop was the core of the single threaded program. exiting
it did mean to exit the program completely.
in freeglut, you have alternatives. but for compatibility, it defaults to the
old behaviour.
On Mon, Jul 30, 2007 at 11:47:46AM +0100, Jon Fairbairn wrote:
ChrisK [EMAIL PROTECTED] writes:
And the readability is destroyed because you cannot do any type inference in
your head.
If you see
{
Matrix m = ;
Matrix x = m * y;
...;
}
Then you know very little
On 7/30/07, John Goerzen [EMAIL PROTECTED] wrote:
On 2007-07-25, david48 [EMAIL PROTECTED] wrote:
HDBC Supports Mysql only through ODBC :(
This is true, unless some MySQL hacker would like to contribute a native
module. I don't use MySQL myself and haven't had the time to write an
On Tue, Jul 31, 2007 at 04:04:17PM -0700, Stefan O'Rear wrote:
On Tue, Jul 31, 2007 at 03:31:54PM -0700, David Roundy wrote:
On Mon, Jul 30, 2007 at 11:47:46AM +0100, Jon Fairbairn wrote:
ChrisK [EMAIL PROTECTED] writes:
And the readability is destroyed because you cannot do any type
Oops, I made mistake to send this mail only for Bulat.
--- Forwarded message ---
From: shelarcy [EMAIL PROTECTED]
To: Bulat Ziganshin [EMAIL PROTECTED]
Subject: Re: Re[4]: [Haskell-cafe] i need wxHaskell compiled for ghc 6.6.1 on
Windows
Date: Wed, 01 Aug 2007 09:03:52 +0900
Hello
Now I wonder what that 7MB file might be? :-)
We (team TNT) implemented KMP over lazy bytestrings as part of our icfp
2007 contest entry. As I remember, for the DNA evaluator it gave modest
speed improvements over more naïve searching. Our implementation was based
upon this blog post:
On Wed, 2007-08-01 at 01:51 +0100, Tim Docker wrote:
Now I wonder what that 7MB file might be? :-)
We (team TNT) implemented KMP over lazy bytestrings as part of our icfp
2007 contest entry. As I remember, for the DNA evaluator it gave modest
speed improvements over more naïve searching. Our
Hi All,
One of the things I've been working on lately is some ASN.1 stuff.One
of the first things I wrote in Haskell was an ASN.1 parser. It only
worked for a subset, and I'm revisiting it to make it handle a
larger subset.
One of the things that gets messy is that in lots of places you can
put
If you create a Data.Map or Data.Set larger than fits in physical
memory, will OS level swapping enable your app to behave reasonably or
will things just die catastrophically as you hit a memory limit?
-Alex-
___
Haskell-Cafe mailing list
Hello shelarcy,
Wednesday, August 1, 2007, 4:03:52 AM, you wrote:
problems. the only question that remains - does this version supports
unicode?
Yes. Current darcs repository version support only unicode
enabled version.
great, it's all what i need. but i'm still curious about other
On Tue, Jul 31, 2007 at 10:45:56PM -0700, Alex Jacobson wrote:
If you create a Data.Map or Data.Set larger than fits in physical memory,
will OS level swapping enable your app to behave reasonably or will things
just die catastrophically as you hit a memory limit?
Data.{Set,Map} uses
68 matches
Mail list logo
