On 7/29/11 10:50 AM, Brian Hurt wrote: > Assuming your type system isn't Turing complete
It is, actually. http://michid.wordpress.com/2010/01/29/scala-type-level-encoding-of-the-ski-calculus/ > with total program knowledge We live with the open world assumption, so taking that as a basis makes the question academic. > it is possible to enumerate all types the program generates. At which > point it is possible for the compiler to do totality checking. The scala pattern matcher does not only discriminate on types, which was kind of my point. If you remove all of the pattern matcher except for type tests, and you remove the open world assumption, then you're in good shape for totality checking. But that takes us far afield. -- You received this message because you are subscribed to the Google Groups "JVM Languages" group. To post to this group, send email to jvm-languages@googlegroups.com. To unsubscribe from this group, send email to jvm-languages+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/jvm-languages?hl=en.
