On Mon, 7 Apr 2008, Manuel M T Chakravarty wrote:
Ganesh Sittampalam:
The following program doesn't compile in latest GHC HEAD, although it does
if I remove the signature on foo'. Is this expected?
Yes, unfortunately, this is expected, although it is very unintuitive.
This is for the followi
On Sun, 6 Apr 2008, Thomas M. DuBuisson wrote:
Id is an operation over types yielding a type, as such it doesn't make
much sense to me to have (Id a -> Id a) but rather something like (a ->
Id a). One could make this compile by adding the obvious instance:
type instance Id a = a
Curiously,
Ganesh Sittampalam:
The following program doesn't compile in latest GHC HEAD, although
it does if I remove the signature on foo'. Is this expected?
Yes, unfortunately, this is expected, although it is very
unintuitive. This is for the following reason.
Let's alpha-rename the signatures an
On Sun, Apr 06, 2008 at 11:30:20AM -0300, Felipe Lessa wrote:
> On Sun, Apr 6, 2008 at 11:12 AM, John Meacham <[EMAIL PROTECTED]> wrote:
> > I implemented this efficient lazy natural class once upon a time. it
> > even has things like lazy multiplication:
> [...]
> > instance Num Nat where
> >
On Mon, 2008-04-07 at 02:57 +0400, Bulat Ziganshin wrote:
> Hello Ian,
>
> Monday, April 7, 2008, 2:50:02 AM, you wrote:
>
> > We (Bjorn Bringert, Duncan Coutts and Ian Lynagh) are pleased to
> > announce that we have recently set up a Haskell consultancy company,
> > Well-Typed LLP (http://www.
Hi Haskell Hackers!
There are only 4 days left until the fourth Hackathon (http://
www.haskell.org/haskellwiki/Hac4) at Chalmers University in
Gothenburg, Sweden.
If you haven't registered, yet, please do so now!
Registration deadline: Tuesday, April 8, 2008
To register, go to http://
Hello Ian,
Monday, April 7, 2008, 2:50:02 AM, you wrote:
> We (Bjorn Bringert, Duncan Coutts and Ian Lynagh) are pleased to
> announce that we have recently set up a Haskell consultancy company,
> Well-Typed LLP (http://www.well-typed.com/).
my congrats! seems you are first in this business :)
Fellow Haskellers,
We (Björn Bringert, Duncan Coutts and Ian Lynagh) are pleased to
announce that we have recently set up a Haskell consultancy company,
Well-Typed LLP (http://www.well-typed.com/).
Our services include application development, library and tool
maintenance, project advice, and tr
Id is an operation over types yielding a type, as such it doesn't make
much sense to me to have (Id a -> Id a) but rather something like (a ->
Id a). One could make this compile by adding the obvious instance:
> type instance Id a = a
Curiously, is this a reduction from a real world use of famil
I'm trying to build hpodder 1.1.2 with ghc 6.8.2. I successfully
downloaded, built, and installed (the latest versions of) all its
dependencies, but when building hpodder itself, I get
FeedParser.hs:146:26:
`Content' is not applied to enough type arguments
Expected kind `??', but `Content'
> I'm not sure if this is documented or not, but for those interested in
> creating a search template for Firefox, Quicksilver and the like, it
> is possible to use a URL such as this to enter a search term:
>
> http://holumbus.fh-wedel.de/hayoo/hayoo.html?query=catmaybes
Well, it is not really do
t.h:
> Hello,
>
> we are pleased to announce the first beta release of Hayoo!, a Haskell API
> search engine providing advanced features like suggestions, find-as-you-type,
> fuzzy queries and much more.
>
> Visit Hayoo! here: http://holumbus.fh-wedel.de/hayoo
>
> Please bear in mind that this
On 06/04/2008, Timo B. Hübel <[EMAIL PROTECTED]> wrote:
> Hello,
>
> we are pleased to announce the first beta release of Hayoo!, a Haskell API
> search engine providing advanced features like suggestions, find-as-you-type,
> fuzzy queries and much more.
Very nice!
I'm not sure if this is docu
On Sunday 06 April 2008 20:31:09 you wrote:
> Overall feedback: Cool! So far, I like Hayoo!, and I'm therefore
> interested in Holumbus. Is there some technical overview available?
Currently, only what you can find on http://holumbus.fh-wedel.de but we will
try to extend the site in the near futu
Hi,
The following program doesn't compile in latest GHC HEAD, although it does
if I remove the signature on foo'. Is this expected?
Cheers,
Ganesh
{-# LANGUAGE TypeFamilies #-}
module Test7 where
type family Id a
type instance Id Int = Int
foo :: Id a -> Id a
foo = id
foo' :: Id a -> Id
t.h:
> Hello,
>
> we are pleased to announce the first beta release of Hayoo!, a Haskell API
> search engine providing advanced features like suggestions, find-as-you-type,
> fuzzy queries and much more.
>
> Visit Hayoo! here: http://holumbus.fh-wedel.de/hayoo
>
> Please bear in mind that this
Timo B. Hübel wrote:
On Sunday 06 April 2008 16:38:03 Richard Kelsall wrote:
Little detail : After visiting a page that appears in the search results
then doing a back button the search I did is no longer there. (On my
eccentric Firefox setup anyway.)
Hm, that's strange. I know about this prob
On Sun, Apr 6, 2008 at 1:24 PM, Timo B. Hübel <[EMAIL PROTECTED]> wrote:
> Hm, that's strange. I know about this problem when using Konqueror, but my
> Firefox (Linux, 2.0.0.13) keeps the results even after visiting the
> documentation and hitting the back button.
My Epiphany works fine. Anyway
On Sunday 06 April 2008 16:38:03 Richard Kelsall wrote:
> Little detail : After visiting a page that appears in the search results
> then doing a back button the search I did is no longer there. (On my
> eccentric Firefox setup anyway.)
Hm, that's strange. I know about this problem when using Konq
Timo B. Hübel wrote:
Hello,
we are pleased to announce the first beta release of Hayoo!, a Haskell API
search engine providing advanced features like suggestions, find-as-you-type,
fuzzy queries and much more.
Visit Hayoo! here: http://holumbus.fh-wedel.de/hayoo
Please bear in mind that thi
On Sun, Apr 6, 2008 at 11:12 AM, John Meacham <[EMAIL PROTECTED]> wrote:
> I implemented this efficient lazy natural class once upon a time. it
> even has things like lazy multiplication:
[...]
> instance Num Nat where
> Zero + y = y
> Sum x n1 + y = Sum x (y + n1)
> --x + Zero = x
>
On Fri, Apr 04, 2008 at 04:46:22PM +0100, Neil Mitchell wrote:
> Where length xs = 1 and ys = 1000. This takes 1000 steps to tell the
> Int's aren't equal, since we don't have proper lazy naturals. If we
> did, it would take 2 steps.
>
> Read this: http://citeseer.ist.psu.edu/45669.html - it argue
Hello,
we are pleased to announce the first beta release of Hayoo!, a Haskell API
search engine providing advanced features like suggestions, find-as-you-type,
fuzzy queries and much more.
Visit Hayoo! here: http://holumbus.fh-wedel.de/hayoo
Please bear in mind that this is still a beta releas
Any help you can offer for my aching cranium will be _much_
appreciated.
You might also be interested in the paper Edwin Brady and Kevin
Hammond just submitted to ICFP:
http://www.cs.st-andrews.ac.uk/~eb/drafts/icfp08.pdf
It describes how to manage resources, in particular locks, in a
David Roundy wrote:
apfelmus wrote:
David Roundy wrote:
porrifolius wrote:
(7) ideally required permissions would appear (and accumulate) in
type signatures via inference so application code knows which are
required and type checker can reject static/dynamic role constraint
violations
In ot
25 matches
Mail list logo
