A conjunctive type system for useless-code elimination

Authors:
Ferruccio Damiani
Affiliations:
Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10149 Torino, Italy. Email: damiani@di.unito.it
Venue:
Mathematical Structures in Computer Science
Year:
2003

Citing 26
Cited 4

Extracting &ohgr;'s programs from proofs in the calculus of constructions

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extraction of redundancy-free programs from constructive natural deduction proofs

Journal of Symbolic Computation
Binding time analysis: a new PERspective

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Control-flow analysis of higher-order languages of taming lambda

Control-flow analysis of higher-order languages of taming lambda
Complete restrictions of the intersection type discipline

Theoretical Computer Science
Deriving algorithms from type inference systems: application to strictness analysis

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The type and effect discipline

Information and Computation
Lazy type inference and program analysis

ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Annotated type and effect systems

ACM Computing Surveys (CSUR)
What are principal typings and what are they good for?

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modular, polyvariant and type-based closure analysis

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Strongly typed flow-directed representation transformations (extended abstract)

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
A core calculus of dependency

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principality and decidable type inference for finite-rank intersection types

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint systems for useless variable elimination

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-based useless variable elimination

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Strictness, totality, and non-standard-type inference

Theoretical Computer Science - Special issue on theories of types and proofs
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
A Typed Intermediate Language for Flow-Directed Compilation

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Refinement Types for Program Analysis

SAS '96 Proceedings of the Third International Symposium on Static Analysis
Minimum Information Code in a Pure Functional Language with Data Types

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
New Notions of Reduction and Non-Semantic Proofs of Strong Beta- Normalization in Typed Lambda Calculi

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Static Calculus of Dependencies for the -Cube

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic useless-code elimination for HOT functional programs

Journal of Functional Programming

Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Expansion: the Crucial Mechanism for Type Inference with Intersection Types: A Survey and Explanation

Electronic Notes in Theoretical Computer Science (ENTCS)
On the rôle of minimal typing derivations in type-driven program transformation

Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the use of conjunctive non-standard type inference for the elimination of useless code in higher-order typed functional programs. In particular, we present a non-standard type assignment system for detecting useless code together with a mapping that simplifies a program by removing the useless code detected using the system.