lawless polymorphhas anyone looked into the theory of and type systems for JIT-like optimizations, where a logical type (e.g. arbitrary size integers) is represented by efficient physical types (e.g. fixed size integers, perhaps for various sizes) and there are run time guards to handle overflows and such, that will switch to a less efficient implementation. does anyone have any references for this sort of thing?
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.