• Home
  • Search
  • Dependent types in practical programming
  • Cite Icon635
  • https://doi.org/10.1145/292540.292560Copy DOI Icon

Dependent types in practical programming

  • Jan 1, 1999
  • Hongwei Xi +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) language schema. This allows specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. A major complication resulting from introducing dependent types is that pure type inference for the enriched system is no longer possible, but we show that type-checking a sufficiently annotated program in DML(C) can be reduced to constraint satisfaction in the constraint domain C. We exhibit the unobtrusiveness of our approach through practical examples and prove that DML(C) is conservative over ML. The main contribution of the paper lies in our language design, including the formulation of type-checking rules which makes the approach practical. To our knowledge, no previous type system for a general purpose programming language such as ML has combined dependent types with features including datatype declarations, higher-order functions, general recursions, let-polymorphism, mutable references, and exceptions. In addition, we have finished a prototype implementation of DML(C) for an integer constraint domain C, where constraints are linear inequalities (Xi and Pfenning 1998).

Similar Papers
  • Research Article
  • Citations87

Dependent ML An approach to practical programming with dependent types

  • Mar 01, 2007
  • Journal of Functional Programming
  • Hongwei Xi
  • Research Article
  • Citations31

Programming with binders and indexed data-types

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

Programming with binders and indexed data-types

  • Jan 25, 2012
  • Andrew Cave +1
  • Conference Article
  • Citations5

Facilitating program verification with dependent types

  • Jan 01, 2003
  • Hongwei Xi
  • Book Chapter
  • Citations62

Dependent Types at Work

  • Jan 01, 2009
  • Ana Bove +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
  • Citations4

A dependently typed assembly language

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

Encoding types in ML-like languages

  • Dec 10, 2003
  • Theoretical Computer Science
  • Zhe Yang
  • Research Article
  • Citations6

Encoding Types in ML-like Languages (Preliminary Version)

  • Jan 09, 1998
  • BRICS Report Series
  • Zhe Yang
  • Research Article
  • Citations47

Eliminating array bound checking through dependent types

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

Combining Proofs and Programs

  • Jan 01, 2011
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Stephanie Weirich
  • Book Chapter
  • Citations31

Dependent Types and Fibred Computational Effects

  • Feb 28, 2003
  • Danel Ahman +2
  • 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
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.