TIL: A Type-Directed Optimizing Compiler for ML.

Tarditi, David; Stone, Chris; Morrisett, Greg; Harper, Robert; Cheng, Perry

doi:10.21236/ada306265

Cited by 89 publications

(110 citation statements)

References 13 publications

Supporting

Mentioning

107

Contrasting

Order By: Relevance

“…The TIL compiler [1,9] uses intensional type analysis in a whole-program compiler to allow native data representations without committing to whole-program compilation. As with the Leroy coercion approach, polymorphic uses of objects require conditionals and boxing coercions to be inserted at use sites, and consequently there is the potential to slow down, rather than speed up, the program.…”

Section: Related Workmentioning

confidence: 99%

GC-Safe Interprocedural Unboxing

Petersen

Glew

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Modern approaches to garbage collection (GC ) require information about which variables and fields contain GC-managed pointers. Interprocedural flow analysis can be used to eliminate otherwise unnecessary heap allocated objects (unboxing), but must maintain the necessary GC information. We define a core language which models compiler correctness with respect to the GC, and develop a correctness specification for interprocedural unboxing optimizations. We prove that any optimization which satisfies our specification will preserve GC safety properties and program semantics, and give a practical unboxing algorithm satisfying this specification.

show abstract

Section: Related Workmentioning

confidence: 99%

GC-Safe Interprocedural Unboxing

Petersen

Glew

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Examples of end-to-end type-preserving compilers with proofs include the TIL compiler of Tarditi et al [33] and the compiler from System F to typed assembly language of Morrisett, Walker, Crary, and Glew [13].…”

Section: Correctnessmentioning

confidence: 99%

ILP-Based Resource-Aware Compilation

Palsberg¹,

Naik²

2005

Multiprocessor Systems-on-Chips

View full text Add to dashboard Cite

“…Monadic normal forms offer the main advantages of CPS (i.e., all intermediate results are named and their computation is sequentialized), 1 and they have been used in compilers for functional languages [7,6,21,22,23,38,40,46]. Therefore, a one-pass transformation into monadic normal form with short-cut boolean evaluation could well be of practical use (i.e., outside academia).…”

Section: O Danvymentioning

confidence: 99%