Sciweavers

75 search results - page 2 / 15
» Separate Compilation for Standard ML
Sort
View
ICFP
2001
ACM
14 years 6 months ago
Functioning without Closure: Type-Safe Customized Function Representations for Standard ML
The CIL compiler for core Standard ML compiles whole ML programs using a novel typed intermediate language that supports the generation of type-safe customized data representation...
Allyn Dimock, Ian Westmacott, Robert Muller, Frank...
PEPM
1994
ACM
13 years 10 months ago
Binding-Time Analysis for Standard ML
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...
Lars Birkedal, Morten Welinder
POPL
1996
ACM
13 years 10 months ago
From Region Inference to von Neumann Machines via Region Representation Inference
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...
Lars Birkedal, Mads Tofte, Magnus Vejlstrup
APLAS
2003
ACM
13 years 9 months ago
Executing Verified Compiler Specification
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...
Koji Okuma, Yasuhiko Minamide
ICFP
2001
ACM
14 years 6 months ago
Contification Using Dominators
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...
Matthew Fluet, Stephen Weeks