Dependent ML

From Wikipedia, the free encyclopedia

Jump to: navigation, search

Dependent ML is an experimental functional programming language proposed by Frank Pfenning and Hongwei Xi. 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.

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

[edit] External links

Languages