A typed intermediate language for flow-directed compilation

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

doi:10.1007/bfb0030639

Cited by 17 publications

(23 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Examples of polyvariant analyses include call-string based approaches, such as k-CFA (Shivers, 1991;Jagannathan & Weeks, 1995;, polymorphic splitting (Wright & Jagannathan, 1998), type-directed flow analysis (Jagannathan et al, 1997), and argument based polyvariance, such as Schmidt's analysis (Schmidt, 1995) and Agesen's cartesian product analysis (Agesen, 1995). In terms of the flow/type correspondence, several forms of flow polyvariance appear to correspond to type polymorphism expressed with intersection and union types (Banerjee, 1997;Wells et al, 1997;Dimock et al, 1997;. Intuitively, intersection types are finitary polymorphic types that model the multiple analyses for a given abstract closure, while union types are finitary existential types that model the merging of abstract values where flow paths join.…”

Section: Introductionmentioning

confidence: 99%

Faithful Translations between Polyvariant Flows and Polymorphic Types

Amtoft

Turbak

2000

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Recent work has shown equivalences between various type systems and flow logics. Ideally, the translations upon which such equivalences are based should be faithful in the sense that information is not lost in round (1) it expresses call-string based polyvariance (such as k-CFA) as well as argument based polyvariance; (2) it enjoys a subject reduction property for flows as well as for types; and (3) it supports a flow-oriented perspective rather than a type-oriented one.

show abstract

Section: Introductionmentioning

confidence: 99%

Faithful Translations between Polyvariant Flows and Polymorphic Types

Amtoft

Turbak

2000

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…The idea is to use types that are annotated with sets. Flow types have been studied by Tang and Jouvelot [32], Heintze [6], Wells, Dimock, Muller, and Turbak [36], and others, who show how to prove soundness for various kinds of flow types. Correctness results for other kinds of annotatedtype systems have been presented by Nielson, Nielson, and Hankin [18].…”

Section: Correctnessmentioning

confidence: 99%

ILP-Based Resource-Aware Compilation

Palsberg¹,

Naik²

2005

Multiprocessor Systems-on-Chips

View full text Add to dashboard Cite

“…Typed intermediate languages [19,18,25,32] support typedirected transformations while simultaneously increasing confidence in the correctness of such transformations. In th~paper, we focus on representation transformations, i.e., those that arise in data type implementations.…”

Section: Introductionmentioning

confidence: 99%

Strongly typed flow-directed representation transformations (extended abstract)

et al. 1997

Self Cite

View full text Add to dashboard Cite

Topic Areascompilation, lambda calculus, intersection and union types, typed flow analysis, closure conversion, Mning AbstractWe present a new framework for transforming data representations in a strongly typed int errnedlate language. Our method allows both value producers (sources) and value consumem (sinks) to support multiple representations, autm aticaily inserting any required code. Specialized representations can be easily chosen for particular Source/sink pairs. The framework is based on these techniques:1. 2.F1OVIannotated types encode the 'flows-from" (source) and "flows-to" (sink) information of a flow graph.Intersection and union types support (a) encoding prc ise flow information, (b) separating flow information so that transformations can be well typed, (c) automatically reorganizing flow paths to enable multiple representations.As au instance of our framework, we provide a function rep resentation transformation that encompasses both closure conversion and inlining. Our framework is adaptable to data other than functions. Intersection me Dimiplinee in Lambda Calcuiua and Applicative Term Rewriting S@errw. PhD thesis, University of Nijmegen, 1993. Anindya Banerjee. A modular, polyvariarrt, and type-based closure analysis. Type inference for recursively constrained types and its application to 00P. In Proc. 1995 Mathematical Foundations of Programming Semantics Conf. Elsevier, 1995. John Hannan. TvDe svstems for closure conversion. In kVorkhop on~ea '~or~rogram Anatuaia, pages 48-62, 1995. DAIMI PB-493.

show abstract

A typed intermediate language for flow-directed compilation

Cited by 17 publications

References 23 publications

Faithful Translations between Polyvariant Flows and Polymorphic Types

Faithful Translations between Polyvariant Flows and Polymorphic Types

ILP-Based Resource-Aware Compilation

Strongly typed flow-directed representation transformations (extended abstract)

Contact Info

Product

Resources

About