Dependent ML

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages) This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (March 2018) (Learn how and when to remove this template message) (Learn how and when to remove this template message)

Dependent ML (DML) is an experimental, multi-paradigm, general-purpose, high-level, functional programming language proposed by Hongwei Xi (Xi 2007) and Frank Pfenning. It is a dialect of the programming language ML. Dependent ML extends ML by a restricted notion of dependent types: types may be dependent on static indices of type Nat (natural numbers). Dependent ML employs a constraint theorem prover to decide a strong equational theory over the index expressions.

DML's types are not dependent on runtime values - there is still a phase distinction between compilation and execution of the program.^[1] By restricting the generality of full dependent types type checking remains decidable, but type inference becomes undecidable.

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

• Xi, Hongwei (March 2007). "Dependent ML: An Approach to Practical Programming with Dependent Types". Journal of Functional Programming 17 (2): 215–286. doi:10.1017/S0956796806006216. 
• David Aspinall and Martin Hofmann [de; de; Martin Hofmann (Informatiker)] (2005). "Dependent Types". In Pierce, Benjamin C. (ed.) Advanced Topics in Types and Programming Languages. MIT Press.

• Official website, Hongwei Xi, ATS designer, maintainer
• The home page of DML

Template:ML programming

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Dependent ML. Read more