Strongly typed flow-directed representation transformations (extended abstract)

Dimock, Allyn; Muller, Robert; Turbak, Franklyn; Wells, J. B.

doi:10.1145/258948.258952

Cited by 23 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later SML compiler efforts, including Flint [22], MLton [12], TILT [21], and Church [2] took the TIL results much further. For example, Flint used a clever combination of Leroy-style coercions and intensional polymorphism to get the best of each approach, and to scale the ideas to the full SML language.…”

Section: The Influence Of Tilmentioning

confidence: 99%

Til

Tarditi

Morrisett

Cheng³

et al. 2004

SIGPLAN Not.

View full text Add to dashboard Cite

The goal of the TIL project was to explore the use of Typed Intermediate Languages to produce high-performance native code from Standard ML (SML). We believed that existing SML compilers were doing a good job of conventional functional language optimizations, as one might find in a LISP compiler, but that inadequate use was made of the rich type information present in the source language. Our goal was to show that we could get much greater performance by propagating type information through to the back end of the compiler, without sacrificing the advantages afforded by loop-oriented and other optimizations.We also confirmed that using typed intermediate languages dramatically improved the reliability and maintainability of the compiler itself. In particular, we were able to use the type system to express critical invariants, and enforce those invariants through type checking. In this respect, TIL introduced and popularized the notion of a certifying compiler, which attaches a checkable certificate of safety to its generated code. In turn, this led directly to the idea of certified object code, inspiring the development of Proof-Carrying Code and Typed Assembly Language as certified object code formats.

show abstract

Section: The Influence Of Tilmentioning

confidence: 99%

Til

Tarditi

Morrisett

Cheng³

et al. 2004

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…The core compiler implementation is based on the architecture specified in [14]. We have extended the simple intermediate language described there with numerous features (e.g., references, arrays, exceptions, standard library functions, etc.)…”

Section: Compiler Architecturementioning

confidence: 99%

“…The representation transformations detailed in [14] are parameterized over seven function representation strategies that heuristically choose the representation for each abstraction and call site. The CIL compiler uses flow types to manage the "plumbing" of the chosen representations, splitting sources and sinks as needed to ensure that all representations are used consistently relative to type and flow information.…”

Section: Compiler Architecturementioning

confidence: 99%

See 1 more Smart Citation

Functioning without closure

et al. 2001

Self Cite

View full text Add to dashboard Cite

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 representations. In this paper, we present empirical data comparing the relative efficacy of several different flow-based customization strategies for function representations. We develop a cost model to interpret dynamic counts of operations required for each strategy. In this cost model, customizing the representation of closed functions gives a 12-17% improvement on average over uniform closure representations, depending on the layout of the closure. We also present data on the relative effectiveness of various strategies for reducing representation pollution, i.e., situations where flow constraints require the representation of a value to be less efficient than it would be in ideal circumstances. For the benchmarks tested and the types of representation pollution detected by our compiler, the pollution removal strategies we consider often cost more in overhead than they gain via enabled customizations. Notable exceptions are selective defunctionalization, a function representation strategy that often achieves significant customization benefits via aggressive pollution removal, and a simple form of flow-directed inlining, in which pollution removal allows multiple functions to be inlined at the same call site.

show abstract

“…The Church project has investigated the use of intersection types for program analyses [Dimock et al 1997]. It can be argued that intersection types are a more natural way to analyze recursive functions than polymorphic recursion.…”

Section: Other Related Workmentioning

confidence: 99%

Type-based analysis of uncaught exceptions

Leroy

Pessaux

2000

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

This article presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a nonstandard type system, using rows to approximate both the flow of escaping exceptions (a la effect systems) and the flow of result values (a la control-flow analyses). The resulting analysis is efficient and precise; in particular, arguments carried by exceptions are accurately handled.

show abstract

Strongly typed flow-directed representation transformations (extended abstract)

Cited by 23 publications

References 13 publications

Til

Til

Functioning without closure

Type-based analysis of uncaught exceptions

Contact Info

Product

Resources

About