Thanks to all!
Paul
On Fri, Mar 19, 2010 at 04:24:17PM +0100, Bas van Dijk wrote:
On Fri, Mar 19, 2010 at 4:03 AM, Nicolas Frisby
nicolas.fri...@gmail.com wrote:
Alternatively:
let f :: some type involving a
f = ...
f' :: a - some type involving a
f' _ = f
in f'
On Fri, Mar 19, 2010 at 4:03 AM, Nicolas Frisby
nicolas.fri...@gmail.com wrote:
Alternatively:
let f :: some type involving a
f = ...
f' :: a - some type involving a
f' _ = f
in f' (undefined :: Int) normal f arguments
Or use Edward Kmett's tagged library:
Hi again,
is there a way in some haskell extension to explicit (system F's) big
lambdas and (term Type) applications in order to help type inference?
If not: is there a way to provide ghc directly with core code before
the type checking phase?
Paul
Hi Paul,
You should be able to introduce \Lambda at the source level by writing
a type signature with an explicit forall. Similarly you can then
instantiate these \Lambdas by using a type signature which is an
instance of the foralled type at the use site:
~~~
-- id will get a \Lambda in Core
id
Alternatively:
let f :: some type involving a
f = ...
f' :: a - some type involving a
f' _ = f
in f' (undefined :: Int) normal f arguments
On Thu, Mar 18, 2010 at 12:10 PM, Max Bolingbroke
batterseapo...@hotmail.com wrote:
Hi Paul,
You should be able to introduce \Lambda at the
