Robert Harper points out that dynamically typed languages are a subset of statically typed languages. To wit, we could handle J values in Haskell with something like:
J's #: (base)
can be used to compute the offset of an array element as it would appear in
memory. Why so? x #: y is +/w*y, where w is formed as */\.}.x,1—w is precisely the strides of an array with dimensions x.
Variable types (à la System F) are not templates, though one can think of them as type schemata. A template
After paraphrasing a computation I had found in a paper, I realized I had ruined its performance.
Apple outperforms R in important cases.
next