In a post about Ruby's dynamic typing, I made the claim:

*Meta-programming 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...

## Recent comments

23 hours 24 min ago

2 days 18 hours ago

1 week 6 days ago

2 weeks 5 days ago

3 weeks 5 days ago

5 weeks 4 days ago

5 weeks 6 days ago

7 weeks 17 hours ago

7 weeks 4 days ago

7 weeks 4 days ago