3 ms·
Numerical algorithms suffer from a paucity of types. So either you enrich your numerical type hierarchy, or you prove an implementation matches a model, e.g. f
by dons 14y ago
Numerical algorithms suffer from a paucity of types. So either you enrich your numerical type hierarchy, or you prove an implementation matches a model, e.g. for fibonacci http://stackoverflow.com/a/8434107/83805 http://stackoverflow.com/a/8434107/83805
- kingkilr 14y agoI don't have a response to that, other than to say, now you know why I decided to write compilers instead of pursue a graduate degree in computer science.