Dependent ML

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Dependent ML is an experimental functional programming language proposed by Hongwei Xi (Xi 2007) and Frank Pfenning. Dependent ML extends ML by a restricted notion of dependent types: types may be dependent on static indices of type Nat. Dependent ML employs a constraint theorem prover to decide a strong equational theory over the index expressions.

By restricting the generality of full dependent types type checking remains decidable. Type inference remains undecidable. Some computer scientists do not consider DML's types to be dependent as there is still a phase distinction between compilation and execution of the program.[1]

Dependent ML has been superseded by ATS and is no longer under active development.

See also[edit]


  1. ^ Aspinall & Hofmann 2005. p. 75.

Further reading[edit]

External links[edit]