Name
Abstract | ||
|---|---|---|
We present λCIL, a typed λ-calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. The key innovation of λCIL is a novel formulation of intersection and union types and flow labels on both terms and types. These flow types can encode polyvariant control and data flow information within a polymorphically typed program representation. Flow types can guide a compiler in generating customized data representations in a strongly typed setting. Since λCIL enjoys confluence, standardization, and subject reduction properties, it is a valuable tool for reasoning about programs and program transformations. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1017/S0956796801004245 | J. Funct. Program. |
Keywords | Field | DocType |
higher order,programming language,polymorphism,optimizing compiler,data flow | ENCODE,Programming language,Union type,Typed lambda calculus,Computer science,Subject reduction,Compiler,Theoretical computer science,Strong and weak typing,Standardization,Data flow diagram | Journal |
Volume | Issue | ISSN |
12 | 3 | 0956-7968 |
Citations | PageRank | References |
28 | 1.14 | 47 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. B. Wells | 1 | 398 | 25.09 |
| Allyn Dimock | 2 | 28 | 1.14 |
| Robert Muller | 3 | 39 | 1.99 |
| Franklyn Turbak | 4 | 55 | 4.54 |