Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-19T15:08:09.181Z Has data issue: false hasContentIssue false
  • English
  • Français

A calculus with polymorphic and polyvariant flow types

Published online by Cambridge University Press:  08 May 2002

J. B. WELLS ,
ALLYN DIMOCK ,
ROBERT MULLER  and
FRANKLYN TURBAK
J. B. WELLS
Affiliation:
Heriot-Watt University, Edinburgh EH14 4AS, Scotland (e-mail: jbw@cee.hw.ac.uk)
ALLYN DIMOCK
Affiliation:
Harvard University, Cambridge, MA 02138, USA (e-mail: dimock@deas.harvard.edu)
ROBERT MULLER
Affiliation:
Boston College, Chestnut Hill, MA 02467, USA (e-mail: muller@cs.bc.edu)
FRANKLYN TURBAK
Affiliation:
Wellesley College, Wellesley MA 02481, USA (e-mail: fturbak@wellesley.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Journal of Functional Programming , Volume 12 , Issue 3 , May 2002 , pp. 183 - 227
Copyright
© 2002 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.