Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time

Dussart, Dirk; Henglein, Fritz; Mossin, Christian

doi:10.1007/3-540-60360-3_36

Cited by 35 publications

(22 citation statements)

References 14 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We cannot aim for completeness here, for a good overview see the recent survey paper by Palsberg in the PASTE'01 workshop. Particularly influencing are the works on region calculus [20], on effect systems [17,13,14], on flow analysis [19], on secrecy and security analysis [8,16,22,21], on binding-time analysis [3,9,12,5,6].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Prototype Dependency Calculus

Thiemann

2002

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Dependency has been identified as the main ingredient underlying many program analyses, in particular flow analysis, secrecy and integrity analysis, and binding-time analysis. Driven by that insight, Abadi, Banerjee, Heintze, and Riecke [1] have defined a dependency core calculus (DCC). DCC serves as a common target language for defining the above analyses by translation to DCC. The present work considers the opposite direction. We define a Prototype Dependency Calculus (PDC) and define flow analysis, secrecy analysis, and region analysis by translation from PDC.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In order to obtain this descriptive property, we introduce a notion of subtyping which only works at the level of annotations. This is a typical step in program analysis [6].…”

Section: Subtypingmentioning

confidence: 99%

A Prototype Dependency Calculus

Thiemann

2002

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…In particular, subtyping (see. [BB95]), ML polymorphism (see [DHM95,Pro97]), conjunctive types (see [DP98]) have been tried out to relax constraints imposed by inference based systems.…”

Section: Static Functional Program Analysismentioning

confidence: 99%

A Formalization of Static Analyses in System F

Prost

1999

Automated Deduction — CADE-16

View full text Add to dashboard Cite

In this paper, we propose a common theoretical framework for type based static functional analyses. The aim is to study the relationships between typing and program analysis. We present a variant of Girard's System F called F Π ≤: . We prove some basic properties of F Π ≤: such as strong normalization, Church-Rosser property, subject reduction etc. We show how F Π ≤: can be used to formalize various program analyses like binding time and dead code, and to encompass previous analyses both in expressivness (often only simply typed calculi are considered) and power (more information can be found on some programs).features polymorphism as well as subtyping at the level of universe extending a previous authors work where only universe polymorphism (on a simply typed calculus). was considered Abstract In this paper, we propose a common theoretical framework for type based static functional analyses. The aim is the study of relationships between typing and program analysis.

show abstract

“…have been introduced, see 18, 16, 2, 1 2 , 1 5 , 2 2 , 25,13]. In this perspective t ypes represent program properties and their inference systems are systems for reasoning formally about them.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper we k eep a clear distinction between the type structure of the language (types in the usual sense) and the annotated types (\non standard" types) which represent, inside the type structure of the language, particular properties. This distinction is very useful from a theoretical point of view, see 16, 2 , 2 2 ], as well as in the design of both checking algorithms, see 15,22], and inference algorithms, see 13,14]. Type based analyzers rely on an implicit representation of types, either via type inequalities, see 19], or via lazy (implicit) types, see 15].…”

Section: Introductionmentioning

confidence: 99%

Detecting and removing dead-code using rank 2 intersection

Damiani

Prost

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we extend, by allowing rank 2 intersection types, the type assignment system for the detection and elimination of dead code in typed functional programs presented by Coppo et al Giannini and the rst author in the Static Analysis Symposium '96. The main application of this method is the optimization of programs extracted from proofs in logical frameworks, but it could be used as well in the elimination of dead code determined by program specialization. This system rely on annotated types which allow to exploit the type structure of the language for the investigation of program properties. The detection of dead code is obtained via annotated type inference, which c a n b e performed in a complete way, b y reducing it to the solution of a system of inequalities between annotation variables. Even though the language considered in the paper is the simply typed -calculus with cartesian product, if-then-else, xpoint, and arithmetic constants we can generalize our approach to polymorphic languages like Miranda, Haskell, and CAML.Keywords: Intersection Types, Dead-Code Analysis, Annotated Types R esum e Dans ce papier nous etendons, en permettant des types intersections de rang 2, un syst eme d'inf erence de types pour la d etection et l' elimination du code mort dans les programmes fonctionnels typ es pr esent e par Coppo et al dans le Static Analysis Symposium '96. La principale application de cette m ethode est l'optimisation de programmes extraits de preuves, mais il peut aussi bien etre utilis e pour l' elimination du code mort produit par la sp ecialisation de programmes. Ce syst eme repose sur des types annot es qui permettent d'exploiter la structure des types du langage pour trouver des propri et es sur un programme. La d etection du code mort est obtenue via un syst eme d'inf erence de types. L'inf erence peutêtre r ealis e e n r eduisant le probl eme a la solution d'un syst eme d'in egalit es entre les variables d'annotations. Bien que le langage consid er e soit le -calcul simplement t yp e etendu par le produit cart esien, le if-then-else, le point xe et des constantes arithm etiques, nous pouvons g en eraliser notre approche aux langages polymorphes tels que Miranda, Haskell et CAML. Abstract. In this paper we extend, by a l l o wing rank 2 intersection types, the type assignment system for the detection and elimination of dead code in typed functional programs presented by Coppo et al in the Static Analysis Symposium '96. The main application of this method is the optimization of programs extracted from proofs in logical frameworks, but it could be used as well in the elimination of dead code determined by program specialization. This system rely on annotated types which allow to exploit the type structure of the language for the investigation of program properties. The detection of dead code is obtained via annotated type inference, which can be performed in a complete way, b y reducing it to the solution of a system of inequalities between annotation variables. Even though the langu...

show abstract

Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time

Cited by 35 publications

References 14 publications

A Prototype Dependency Calculus

A Prototype Dependency Calculus

A Formalization of Static Analyses in System F

Detecting and removing dead-code using rank 2 intersection

Contact Info

Product

Resources

About