Detecting and removing dead-code using rank 2 intersection

DOI10.1007/BFB0097787MaRDI QIDQ4246944zbMATH OpenFDO

Authors Ferruccio Damiani, Frédéric Prost

Publication date 13 December 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0097787

zbMATH Keywords

annotated typesdead-codenonstandard type assignment systemoptimization of programs extracted from proofs in logical frameworksrank 2 intersectionsimply typed \(\lambda\)-calculustyped functional programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Recommendations

• Eliminating partially dead code in explicitly parallel programs
• Dead code elimination based pointer analysis for multithreaded programs
• Compiler Construction
• Automatic useless-code elimination for HOT functional programs
• Elimination of redundant messages with a two-pass static analysis algorithm
• Modular control-flow analysis with rank 2 intersection types

Cited in

(4)

• Eliminating dead code on recursive data.
• Approximation semantics and expressive predicate assignment for object-oriented programming (extended abstract)
• Semantic types and approximation for Featherweight Java
• Refinement types for program analysis

Describes a project that uses

Uses Software

• LEGO
• Coq

This page was built for publication: Detecting and removing dead-code using rank 2 intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246944)