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  6911 reads

Browse archivesActive forum topics 
Recent comments
20 min 57 sec ago
2 hours 5 min ago
10 hours 22 min ago
10 hours 22 min ago
10 hours 58 min ago
12 hours 32 min ago
14 hours 51 min ago
17 hours 39 min ago
18 hours 16 min ago
19 hours 6 min ago