--- Galchin Vasili <[EMAIL PROTECTED]> wrote:
> [snip]
>
> I have fished around and collected some Sun
> papers and slides. If any
> anybody wants I can post the URLs or send to the
> interested
Yes, I am interested. Please post the URLs, and I
will flag the message and refer to the assoc
It does. Thank you...
On Thu, Feb 28, 2008 at 5:00 PM, Albert Y. C. Lai <[EMAIL PROTECTED]> wrote:
> Jefferson Heard wrote:
> > Main: No match in record selector Protein.go_terms
>
> data R = A { sa :: Int } | B { sb :: Int }
>
> sa (A 0) works (as expected). sa (B 0) gives
>
> *** Exception: No
Hi
> You can try aggressive caching and indexing (which google uses often)
> based on 20-80 rule.
The Hoogle logs suggest this wouldn't be that useful. The most
commonly invoked searches are the three listed on the front page.
After that, the most common search is actually for "where", at under
You can try aggressive caching and indexing (which google uses often)
based on 20-80 rule.
http://en.wikipedia.org/wiki/Pareto_principle
On Thu, Feb 28, 2008 at 7:49 PM, Neil Mitchell <[EMAIL PROTECTED]> wrote:
> Hi Steve,
>
> > Would you consider adding auto-complete feature on Hoogle in the fo
Jefferson Heard wrote:
Main: No match in record selector Protein.go_terms
data R = A { sa :: Int } | B { sb :: Int }
sa (A 0) works (as expected). sa (B 0) gives
*** Exception: No match in record selector Main.sa
I think that explains your problem.
___
In case you're curious, Wadler's blog post is here:
http://wadler.blogspot.com/2008/02/data-types-la-carte.html
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I was reading Philip Wadler's post regarding the expression problem
and Wouter Swierstra's paper, "Data Types a la Carte".
Philip asks: The instances of the injection function for subtypes are
assymmetric. Is there a symmetric solution in Haskell?
Here is a solution which works under GHC 6.8.2,
Hi Steve,
> Would you consider adding auto-complete feature on Hoogle in the forth
> coming release?
>
> http://wiki.script.aculo.us/scriptaculous/show/Ajax.Autocompleter
I am slightly hoping that I'll be able to remove the Search button
entirely, and just have results as you type. Whether tha
Neil,
Would you consider adding auto-complete feature on Hoogle in the forth
coming release?
http://wiki.script.aculo.us/scriptaculous/show/Ajax.Autocompleter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/
On Thu, Feb 28, 2008 at 11:23 PM, Matthew Sackman <[EMAIL PROTECTED]> wrote:
> If however, you are as mad as I, and enjoy pushing the GHC type system
> to the limit, then you may enjoy looking at the implementation in all
> its glory. base10 numbers, lists, associative maps and a whole lot of
>
A bit late, sorry, but you could use this:
http://www.wellquite.org/hinstaller/
On Thu, Feb 7, 2008 at 5:29 AM, Dave Bayer <[EMAIL PROTECTED]> wrote:
> What is the best way to embed an arbitrary file in a Haskell program?
>
> I would like to use GHC to compile command-line tools to be used with
Hi,
So for those of you that watch the hackage what's-new page, you will
probably be aware of this. For the last few months, there's been
significant work on my implementation of Session Types in Haskell.[0]
The reason for this particular announcement is that it should now be at
a point where fun
I'm getting this error when I try to render the text contained in a record
structure in the Protein module. Does this mean that the thunk that could
calculate go_terms is being evaluated for the first time in the program?
go_terms is calculated by a Data.Map.! lookup operation.
Main: No match in
Hi
> The top match of hoogle "(a -> b) -> b" is the inexact match
>
> Control.Monad.State.Class.gets :: MonadState s m => (s -> a) -> m a
>
> (which cannot be made to unify with (a -> b) -> b) instead of
>
> Control.Monad.Cont.runCont (undefined :: Cont r a) :: (a -> r) -> r
>
> which does.
I have a question about the ranking algorithm of Hoogle 3.1:
The top match of hoogle "(a -> b) -> b" is the inexact match
Control.Monad.State.Class.gets :: MonadState s m => (s -> a) -> m a
(which cannot be made to unify with (a -> b) -> b) instead of
Control.Monad.Cont.runCont (undefined :: C
Hi,
In John Hughes\' paper \"Programming with arrows\" [1] Section 5, the
simulation arrow is defined (Sim). All the examples went well.
However, when I want to use it beyond circuit simulation and I added a
\"if-then-else\" line, GHC is asking to define ArrowChoice for Sim.
Does anybody have the
Hello Vasys,
I am quite interested in concurrency and Haskell.
I appreciate your effort, and I would like the URLs, if you don't mind.
Can you elaborate on your statement "IMO a gauntlet has been thrown down to
the Haskell world here."? Are you implying that this is an opportunity for
Haskell an
1) Berkeley consternation about the inability of current concurrency to keep
up with multicor developments
1)
http://www.eetimes.com/news/latest/showArticle.jhtml;jsessionid=CWDB5YTIKPC4QQSNDLPSKH0CJUNN2JVN?articleID=206801376&pgno=2&printable=true
http://www.eetimes.com/news/latest/showArticle.j
This library provides an implementation of parameterized types using
type-level computations to implement the type parameters and emulate
dependent types.
Right now only fixed-sized vectors are provided (based on Oleg's
"Number-parameterized types" [1] and Frederik Eaton's Vectro library
[2])
At 13:23 28/02/2008, you wrote:
Hello,
I wish I could be there, but I'm in Kentucky. ;)
It would be great if someone could have this talk recorded and
posted on youtube, or something similar.
Thank you.
Now, there's an idea which could be extended to all Haskell related
gatherings.
__
Hello,
I wish I could be there, but I'm in Kentucky. ;)
It would be great if someone could have this talk recorded and posted on
youtube, or something similar.
Thank you.
__
Donnie
On 2/27/08, Bryan O'Sullivan <[EMAIL PROTECTED]> wrote:
>
> Satnam Singh of Microsoft Research will be speaking ab
Hi
I installed ghc 6.8 from source and I've been installing packages from
hackage. I'm not sure when the problem started, but I've been getting this
error trying to install any cabal package.. accept apparently, Cabal itself.
Setup.hs:2:0:
Warning: Deprecated use of `defaultUserHooks'
On Thu, Feb 28, 2008 at 8:15 AM, Roel van Dijk <[EMAIL PROTECTED]> wrote:
> I'm nitpicking but,
Not a nitpick, a great difference =). As someone else already said on
this list, it's not good to answer e-mails in the early morning heh.
Thanks,
--
Felipe.
_
I'm nitpicking but,
On Thu, Feb 28, 2008 at 11:44 AM, Felipe Lessa <[EMAIL PROTECTED]> wrote:
> Bas van Dijk's 'always' (also called 'forever'[1])
forever a = a >> forever a
always f z = f z >>= always f
Forever doesn't pass the result of the action to its recursive call,
always does.
_
On Thu, Feb 28, 2008 at 7:44 AM, Felipe Lessa <[EMAIL PROTECTED]> wrote:
> Bas van Dijk's 'always' (also called 'forever'[1])
Sorry, of course
always' :: Monad m => (a -> m a) -> (a -> m ())
forever :: Monad m => (m a) -> (m ())
are of different types and so are different functions.
--
Felipe
On Thu, Feb 28, 2008 at 4:28 AM, Aaron Altman <[EMAIL PROTECTED]> wrote:
> runActionAndIterate :: [a -> a] -> a -> (a, [a -> a])
> runActionAndIterate (currentAction:actionList) actionInput =
> (currentAction actionInput, concat [actionList, [currentAction]])
>
> shiftActionList :: [a -> a] ->
On Thu, Feb 28, 2008 at 8:28 AM, Aaron Altman <[EMAIL PROTECTED]> wrote:
> I am working on an AI agent that will perform a finite series of actions
> before starting the sequence over again. I figured a circular list of
> functions that shifts as you apply them would be the way to do it...
I t
27 matches
Mail list logo
