On 1/23/12 10:39 PM, Ryan Ingram wrote:
type m :-> n = (forall x. m x -> n x)
class Functor f where fmap :: forall a b. (a -> b) -> f a -> f b
-- Functor identity law: fmap id = id
-- Functor composition law fmap (f . g) = fmap f . fmap g
Given Functors m and n, natural
Steve Horne blueyonder.co.uk> writes:
>
> There's a proposal at the moment to add support for TDNR to Haskell
> - to leverage "the power of the dot" (e.g. for
intellisense).http://hackage.haskell.org/trac/haskell-
prime/wiki/TypeDirectedNameResolution
> I approve of the goal, ...
S
Welcome to issue 212 of the HWN, a newsletter covering developments in
the Haskell community. This issue covers top Haskell stories from
around the web found between January 11 to 21, 2012.
You can find the HTML version at:
http://contemplatecode.blogspot.com/2012/01/haskell-weekly-news-issue-212.
Can we please have something done about this spam that's been
happening semi-regularly here?
On 26 January 2012 03:13, R J wrote:
> hello Haskell the holidays are coming up soon and I think this can help
> http://www.news13open.com
>
> ___
> Haskell-Ca
Hello!
I'm pleased to announce the second major release of the biostockholm
library! This library allows you to parse and render files in the
Stockholm 1.0 format, which is used by Pfam, Rfam, Infernal and others
for holding information about families of proteins or non-coding RNAs.
http://hac
I tried the free theorem generator (
http://www-ps.iai.uni-bonn.de/cgi-bin/free-theorems-webui.cgi) and it
wouldn't let me use generic functors, but playing with [] and Maybe leads
me to believe that the free theorem for :-> is
forall f :: m :-> n, forall g :: a -> b, g strict and total
fmap g . f
On 26 January 2012 16:33, JP Moresmau wrote:
> Thomas, thank you for that explanation about the different type of
> identifiers in the different phases of analysis. I've never seen that
> information so clearly laid out before, can it be added to the wikis
> (in http://hackage.haskell.org/trac/gh
On 01/26/2012 11:16 AM, dokondr wrote:
On Thu, Jan 19, 2012 at 1:37 AM, Dag Odenhallwrote:
On Tue, 2012-01-17 at 22:05 +0300, dokondr wrote:
I prefer using Turing complete PL to program web client, like the one
used
in GWT (Java) or Cappuccino (Objective-J). http://cappuccino.org/learn/
I
Thomas, thank you for that explanation about the different type of
identifiers in the different phases of analysis. I've never seen that
information so clearly laid out before, can it be added to the wikis
(in http://hackage.haskell.org/trac/ghc/wiki/Commentary/Compiler/API
or http://www.haskell.or
On 26 January 2012 09:24, Christopher Brown wrote:
> Hi Thomas,
>
> By static semantics I mean use and bind locations for every name in the
AST.
Right, that's what the renamer does in GHC. The GHC AST is parameterised
over the type of identifiers used. The three different identifier types
are:
On Thu, Jan 19, 2012 at 1:37 AM, Dag Odenhall wrote:
>
> On Tue, 2012-01-17 at 22:05 +0300, dokondr wrote:
> >
> > I prefer using Turing complete PL to program web client, like the one
> used
> > in GWT (Java) or Cappuccino (Objective-J). http://cappuccino.org/learn/
> > In this case you /almost/
On 2012-01-24 05:32, Michael Snoyman wrote:
On Fri, Jan 20, 2012 at 6:52 AM, Michael Snoyman wrote:
provide an extra warning flag (turned on by -Wall) that will
>> warn when you match on a failable pattern.
I've filed a feature request for this warning:
http://hackage.haskell.org/trac/ghc/ti
***
LDTA 2012 Call for Participation
12th International Workshop on
Language Descriptions, Tools, and Applicatio
One day, I _really_ should learn all GHCI commands...
Thanks, Felipe ^^
2012/1/25 Felipe Almeida Lessa
> On Wed, Jan 25, 2012 at 7:38 PM, Yves Parès wrote:
> > But I haven't found a way to tell GHCI to fully evaluate 'x' but _not_
> print
> > its value.
>
> Use the :force, Yves!
>
> > let {a =
Hi Thomas,
By static semantics I mean use and bind locations for every name in the AST.
For example:
f x = let x = x + 1 in x
Should parse as something like
HsMatch ("f" (HsPat "x" (1,2) (1,2)) (HsBody (HsExp (HsLet (HsMatch ("x" (8,1)
(8,1)) (HsExp (HsInfix (+) (1) ("x") (12,1) (8,1)) ("x"
I'm a little worried about the use of `fromJust`, it will give users a
very confusing error message, and the error might be trigged at the
wrong point in the computation. I'd feel better if checkRedirect lived
in either some Failure, an Either, or maybe even in IO itself. IO
might make sense if we
Here is a patch regarding getRedirectedRequest. Comments are very welcome.
--Myles C. Maxfield
On Wed, Jan 25, 2012 at 10:21 PM, Myles C. Maxfield <
myles.maxfi...@gmail.com> wrote:
> I was planning on making the caller deal with keeping track of cookies
> between requests. My cookie idea only s
17 matches
Mail list logo
