You might like this one then:
http://michid.wordpress.com/2010/01/29/scala-type-level-encoding-of-the-ski-calculus/
 :)


On 2 September 2010 22:20, Graham Allan <[email protected]> wrote:

> Hey Kevin,
>
> One thing that the page doesn't include (AFAICT) is a discussion of what
> you
> have referred to elsewhere on this mailing list as a 'Turing-complete type
> system'. A few minutes of googling hasn't uncovered any decent resources on
> what this actually means - in a way I find relatable, at least. All I found
> on
> Lambda-the-Ultimate was a suggestion that all this kind of type-system does
> is
> introduce the halting problem to the compiler[1].
>
> Do you know of any resources that discuss the benefits Scala's
> Turing-complete
> type system?
>
> Regards,
> Graham
>
>
> [1] http://lambda-the-ultimate.org/node/707#comment-6440
>



-- 
Kevin Wright

mail / gtalk / msn : [email protected]
pulse / skype: kev.lee.wright
twitter: @thecoda

-- 
You received this message because you are subscribed to the Google Groups "The 
Java Posse" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/javaposse?hl=en.

Reply via email to