A formalization of Static Analyses in System F

Authors:
Frédéric Prost
Affiliations:
-
Venue:
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Year:
1999

Citing 4
Cited 1

Using Subtyping in Program Optimization

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Detecting and Removing Dead-Code using Rank 2 Intersection

TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Control-Flow Analysis and Type Systems

SAS '95 Proceedings of the Second International Symposium on Static Analysis

A Static Calculus of Dependencies for the -Cube

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a common theoretical framework for type based static analyses. The aim is the study of relationships between typing and program analysis. We present a variant of Girard's System F called F≤:Π. We prove standard properties of F≤:Π. We show how it can be used to formalize various program analyses like binding time and dead code. We relate our work to previous analyses in terms of expressivness (often only simply typed calculi are considered) and power (more information can be inferred). F≤:Π features polymorphism as well as subtyping at the level of universe extending previous author work where only universe polymorphism (on a simply typed calculus) was considered.