Encoding Intensional Type Analysis

  • Stephanie Weirich
Conference paper

DOI: 10.1007/3-540-45309-1_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2028)
Cite this paper as:
Weirich S. (2001) Encoding Intensional Type Analysis. In: Sands D. (eds) Programming Languages and Systems. ESOP 2001. Lecture Notes in Computer Science, vol 2028. Springer, Berlin, Heidelberg

Abstract

Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to support this operation, which hinder optimization and complicate the meta-theory of these languages. In this paper, we observe that such specialized operators need not be intrinsic to the language, and in fact, their operation may be simulated through standard encodings of iteration in the polymorphic lambda calculus. Therefore, we may more easily add intensional analysis operators to complicated languages via translation, instead of language extension.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Stephanie Weirich
    • 1
  1. 1.Department of Computer ScienceCornell University Ithaca

Personalised recommendations