35 search results - page 2 / 7 » A Type-Based Compiler for Standard ML |
PEPM
1994
ACM
13 years 9 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
POPL
1996
ACM
13 years 9 months ago
1996
ACM
Region Inference is a technique for implementing programming languages that are based on typed call-by-value lambda calculus, such as Standard ML. The mathematical runtime model o...
ICFP
2001
ACM
14 years 5 months ago
2001
ACM
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
APLAS
2003
ACM
13 years 9 months ago
2003
ACM
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
ICFP
2001
ACM
14 years 5 months ago
2001
ACM
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...