No Assembly Required: Compiling ML to C DAVID and ANURAG ACHARYA TARDITI, PETER LEE. Standard Carnegie Mellon University C has have ML been used as a portable efforts on portability making such target and language these tail The proper style that for implementing languages recursion. compilation compiler by and We also advanced We languages produced how show like Standard ML and Scheme. Previous at compiling compromises. to C have effkient code, but Standard compilthat is and that compiler compromised to C without ML a factor highly that language to compile and then technique achieves features is based on converting speed The collection Standard ing this about generates first-class tion would to a continuation-passing to C. The of two portable lead slower than A-calculus by this intermediate a native determine suggest language code like the compiler. code generated still an execution garbage aspects generated supports code, yet We analyze continuations. support and the performance slowdown. methods. D.3.2 [Programming of the compila- method better to the such observed changes to C compilers compilation Categories tions; General Additional Standard D.3.4 Subject Descriptors: Languages]: Language Classifica- [Programming Languages Words and Languages]: Processors compilers Terms: Key ML Phrases: Compilation to C, continuation-passing style,
/lp/association-for-computing-machinery/no-assembly-required-compiling-standard-ml-to-c-5Dseftru6g