Re: [stack] Self Types

The Y and M combinators can't be typed using a simple type system without
recursive types. They can however be typed using a more sophisticated type
system that includes recursive types, dependent types, or, as I am
proposing, self types.

- Christopher


On 6/15/07, John Cowan <[email protected]> wrote:
>
>   Manfred Von Thun scripsit:
>
> > My recollection is that there are some difficulties about typing the
> > y combinator in lambda calculus languages, but don¹t ask me for details.
>
> The difficulty is that it can't be done, on Russell type theory grounds.
>
> --
> Don't be so humble. You're not that great. John Cowan
> --Golda Meir [email protected] <cowan%40ccil.org>
> 
>


[Non-text portions of this message have been removed]