[Haskell] PhD position in Communicating Transactions at Trinity College Dublin

Language Support for Communicating Transactions A three year PhD position, to start in September 2011, is now available at Trinity College Dublin, Ireland, associated with the project "Language Support for Communicating Transactions" funded by the Microsoft Research PhD Scholarship scheme. Three y

Re: [Haskell] Fixpoint combinator without recursion

On Wed, Apr 04, 2007 at 02:57:06PM -0700, Dan Weston wrote: > What is it called if it's both? Is this even legal in Haskell? It seems > as though this would not be a grounded type, going on forever in both > directions. I guess "negative datatype" is being a bit loose with terminology; the funct

[Haskell] Fixpoint combinator without recursion

Hey, It is well-known that negative datatypes can be used to encode recursion, without actually explicitly using recursion. As a little exercise, I set out to define the fixpoint combinator using negative datatypes. I think the result is kinda cool :) Comments are welcome :) Edsko {- Def

[Haskell] Higher kind type inference paper

Hi, Are there any papers that describe how higher kind type inference (and I really mean higher kind, not higher rank) is done? Thanks, Edsko ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] Type inference for arbitrary rank types

Hi, I am currently studying the paper "Practical Type Inference for Arbitrary Rank Types" by Simon Peyton Jones and Mark Shields, and I've been wondering about the final version of the typing rules (figure 7, "Bidirectional version of Odersky-Laufer") (although I suppose the question is slightly m