Encoding Intensional Type Analysis

Authors:
Stephanie Weirich
Affiliations:
-
Venue:
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Year:
2001

Citing 17
Cited 4

How to make ad-hoc polymorphism less ad hoc

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inductively defined types

COLOG-88 Proceedings of the international conference on Computer logic
Inductively defined types in the calculus of constructions

Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics

Logical frameworks
Compiling polymorphism using intensional type analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-directed partial evaluation

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of programming languages

Foundations of programming languages
Encoding types in ML-like languages

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Intensional polymorphism in type-erasure semantics

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Type fixpoints: iteration vs. recursion

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Flexible type analysis

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Fully reflexive intensional type analysis

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML

The Definition of Standard ML
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
A Logic for Parametric Polymorphism

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Inductive Definitions in the system Coq - Rules and Properties

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Simplification of Girard's Paradox

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications

Type-Indexed Data Types

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Parametricity, type equality, and higher-order polymorphism

Journal of Functional Programming
“Scrap your boilerplate” revolutions

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Typed tagless final interpreters

SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming

Quantified Score

Hi-index	0.00

Visualization

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.