Dependent ML An approach to practical programming with dependent types
Author:
- 1 March 2007
- journal article
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 17 (2) , 215-286
Abstract
We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index terms are required to be drawn from a given type index language ${\cal L}$ that is completely separate from run-time programs, leading to the DML( ${\cal L}$ ) language schema. This enrichment allows for specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. The primary contribution of the paper lies in our language design, which can effectively support the use of dependent types in practical programming. In particular, this design makes it both natural and straightforward to accommodate dependent types in the presence of effects such as references and exceptions.
Keywords
This publication has 33 references indexed in Scilit:
- Languages of the future2004
- Eliminating array bound checking through dependent types1998
- Purely Functional Data Structures1998
- Local type inference1998
- Simple imperative polymorphismHigher-Order and Symbolic Computation, 1995
- Parallel Reductions in λ-CalculusInformation and Computation, 1995
- Synthesizing proofs from programs in the Calculus of Inductive ConstructionsLecture Notes in Computer Science, 1995
- Experiences with constraint-based array dependence analysisLecture Notes in Computer Science, 1994
- Higher-order abstract syntax1988
- On the SUP-INF Method for Proving Presburger FormulasJournal of the ACM, 1977