User loginNavigation 
Can a dynamically typed language support type inference?In a post about Ruby's dynamic typing, I made the claim: Metaprogramming makes the type inference problem equivalent to the halting problem. Am I wrong? Basically, I am wondering if there are type inference algorithms (or better still, implementations) that can handle programming languages where the operations permitted with respect to a variable (a/k/a types) change at run time. Your corrections and pointers to current research and/or implementations would be greatly appreciated. Thanks in advance... By raganwald at 20060818 17:44  LtU Forum  previous forum topic  next forum topic  other blogs  10967 reads

Browse archivesActive forum topics 
Recent comments
5 hours 19 min ago
2 weeks 1 hour ago
6 weeks 1 day ago
6 weeks 5 days ago
6 weeks 5 days ago
8 weeks 5 days ago
8 weeks 5 days ago
9 weeks 1 day ago
9 weeks 1 day ago
10 weeks 1 day ago