User loginNavigation 
SSA + Type Inference = "Compile time" dynamic typing, "runtime" static typing?If we SSA transform our program and _then_ perform type inference (glossing over issues like if we get always infer somethings type), do we get strong static dynamic typing? e.g.: a = 1 b = a + 1 a = "hello" printLine a . . . a0 = 1 b0 = a0 + 1 a1 = "hello" printLine a1 Of course there are scenarios like:
But I believe that these scenarios can be overcome. My question is then, is this impossible for any reason? By Logan Capaldo at 20060923 16:49  LtU Forum  previous forum topic  next forum topic  other blogs  7382 reads

Browse archivesActive forum topics 
Recent comments
22 hours 59 min ago
1 day 3 hours ago
2 days 3 hours ago
2 days 5 hours ago
2 days 11 hours ago
3 days 4 hours ago
3 days 13 hours ago
4 days 18 min ago
4 days 1 hour ago
4 days 1 hour ago