• Home
  • Search
  • Dead Code Elimination through Dependent Types
  • Cite Icon43
  • https://doi.org/10.1007/3-540-49201-1_16Copy DOI Icon

Dead Code Elimination through Dependent Types

  • Jan 1, 1998
  • Hongwei Xi
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Pattern matching is an important feature in various functional programming languages such as SML, Caml, Haskell, etc. In these languages, unreachable or redundant matching clauses, which can be regarded as a special form of dead code, are a rich source for program errors. Therefore, eliminating unreachable matching clauses at compiletime can significantly enhance program error detection. Furthermore, this can also lead to significantly more efficient code at run-time. We present a novel approach to eliminating unreachable matching clauses through the use of the dependent type system of DML, a functional programming language that enriches ML with a restricted form of dependent types. We then prove the correctness of the approach, which consists of the major technical contribution of the paper. In addition, we demonstrate the applicability of our approach to dead code elimination through some realistic examples. This constitutes a practical application of dependent types to functional programming, and in return it provides us with further support for the methodology adopted in our research on dependent types in practical programming.

Similar Papers
  • Conference Article
  • Citations5

Facilitating program verification with dependent types

  • Jan 01, 2003
  • Hongwei Xi
  • Conference Article
  • Citations3

Dead code elimination technique in eclipse compiler for Java

  • Dec 01, 2015
  • Hiral H Karer +1
  • Conference Article
  • Citations635

Dependent types in practical programming

  • Jan 01, 1999
  • Hongwei Xi +1
  • Research Article
  • Citations87

Dependent ML An approach to practical programming with dependent types

  • Mar 01, 2007
  • Journal of Functional Programming
  • Hongwei Xi
  • Dissertation

Classifying Dead Code in Software Development

  • Mar 01, 2022
  • Arman Alavizadeh
  • Conference Article

Combining Proofs and Programs

  • Jan 01, 2011
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Stephanie Weirich
  • Conference Article
  • Citations96

A dependently typed assembly language

  • Oct 01, 2001
  • Hongwei Xi +1
  • Research Article
  • Citations4

A dependently typed assembly language

  • Oct 01, 2001
  • ACM SIGPLAN Notices
  • Hongwei Xi +1
  • Research Article
  • Citations337

The view from the left

  • Jan 01, 2004
  • Journal of Functional Programming
  • Conor Mcbride +1
  • Research Article

The Opticode: A User-Centric Tool for Enhancing Software Efficiency and Minimizing Errors Through Dead Code Elimination and Loop Invariant Code Motion Techniques

  • Dec 18, 2024
  • Communications on Applied Nonlinear Analysis
  • Tulshihar Patil
  • Research Article
  • Citations4

Safe functional reactive programming through dependent types

  • Aug 31, 2009
  • ACM SIGPLAN Notices
  • Neil Sculthorpe +1
  • Conference Article
  • Citations42

Safe functional reactive programming through dependent types

  • Aug 31, 2009
  • Neil Sculthorpe +1
  • Book Chapter
  • Citations16

Refinement types for program analysis

  • Jan 01, 1996
  • Mario Coppo +2
  • Research Article
  • Citations47

Eliminating array bound checking through dependent types

  • May 01, 1998
  • ACM SIGPLAN Notices
  • Hongwei Xi +1
  • Research Article
  • Citations56

System Description: Delphin – A Functional Programming Language for Deductive Systems

  • Jan 01, 2009
  • Electronic Notes in Theoretical Computer Science
  • Adam Poswolsky +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.