User loginNavigation |
Static typing may require runtime type checking?This may be obvious to many of you, but it got me thinking: module Main where data Z = X Int | Y Int xy z = case z of X a -> "X" Y a -> "Y" x = X 0 y = Y 1 Above Haskell program works as expected: (xy x) outputs X and (xy y) outputs Y. So although Haskell uses static typing, at times it needs to do type checking at runtime? Any studies on overhead of runtime type checking in languages employing static vs. "dynamic" typing? By sidhu at 2009-05-04 07:47 | LtU Forum | previous forum topic | next forum topic | other blogs | 6385 reads
|
Browse archivesActive forum topics |
Recent comments
7 weeks 3 hours ago
7 weeks 1 day ago
7 weeks 3 days ago
14 weeks 3 days ago
20 weeks 1 day ago
20 weeks 2 days ago
21 weeks 1 day ago
23 weeks 6 days ago
25 weeks 2 days ago
25 weeks 2 days ago