• Home
  • Search
  • Eliminating array bound checking through dependent types
  • Cite Icon47
  • https://doi.org/10.1145/277652.277732Copy DOI Icon

Eliminating array bound checking through dependent types

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can still be performed efficiently in practice. We illustrate our approach through concrete examples and present the result of our preliminary experiments which support support the feasibility and effectiveness of our approach.

Similar Papers
  • Conference Article
  • Citations5

Facilitating program verification with dependent types

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

Dependent types in practical programming

  • Jan 01, 1999
  • Hongwei Xi +1
  • Book Chapter
  • Citations43

Dead Code Elimination through Dependent Types

  • Jan 01, 1998
  • Hongwei Xi
  • Conference Article
  • Citations96

A dependently typed assembly language

  • Oct 01, 2001
  • 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
  • Research Article
  • Citations4

A dependently typed assembly language

  • Oct 01, 2001
  • ACM SIGPLAN Notices
  • Hongwei Xi +1
  • Book Chapter
  • Citations24

ATS: A Language That Combines Programming with Theorem Proving

  • Jan 01, 2005
  • Sa Cui +2
  • Research Article
  • Citations31

Programming with binders and indexed data-types

  • Jan 18, 2012
  • ACM SIGPLAN Notices
  • Andrew Cave +1
  • Conference Article
  • Citations4

Refinement types for Haskell

  • Jan 11, 2014
  • Ranjit Jhala
  • Book Chapter
  • Citations60

Polymorphic Type Inference for the JNI

  • Jan 01, 2006
  • Michael Furr +1
  • Conference Article
  • Citations30

Programming with binders and indexed data-types

  • Jan 25, 2012
  • Andrew Cave +1
  • Book Chapter
  • Citations26

Non-dependent Types for Standard ML Modules

  • Jan 01, 1999
  • Claudio V Russo
  • Research Article

Functional Unparsing

  • Jan 12, 1998
  • BRICS Report Series
  • Olivier Danvy
  • Conference Article
  • Citations32

An implementation of standard ML modules

  • Jan 01, 1988
  • David Macqueen
  • Research Article
  • Citations83

Functional unparsing

  • Nov 01, 1998
  • Journal of Functional Programming
  • Olivier Danvy
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.