About: Dependent ML     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatProgrammingLanguagesCreatedInThe1990s, within Data Space : dbpedia.org:8891 associated with source document(s)
QRcode icon
http://dbpedia.org:8891/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDependent_ML

Dependent ML is an experimental functional programming language proposed by Hongwei Xi and Frank Pfenning. 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. Dependent ML has been superseded by ATS and is no longer under active development.

AttributesValues
rdf:type
rdfs:label
  • Dependent ML (en)
  • Dependent ML (ru)
rdfs:comment
  • Dependent ML — экспериментальный функциональный язык программирования, разработанный Фрэнком Пфеннингом и Хонвэем Си как расширение ML путём ограничения представления зависимых типов: типы могут зависеть от статических указателей типа Nat. Основывается на ограниченном доказательстве теорем для вывода теории строго равенства через индексные выражения[уточнить]. Был замещён языком ATS и по этой причине в фазе активной разработки больше не находится. (ru)
  • Dependent ML is an experimental functional programming language proposed by Hongwei Xi and Frank Pfenning. 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. Dependent ML has been superseded by ATS and is no longer under active development. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Dependent ML is an experimental functional programming language proposed by Hongwei Xi and Frank Pfenning. 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. 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. (en)
  • Dependent ML — экспериментальный функциональный язык программирования, разработанный Фрэнком Пфеннингом и Хонвэем Си как расширение ML путём ограничения представления зависимых типов: типы могут зависеть от статических указателей типа Nat. Основывается на ограниченном доказательстве теорем для вывода теории строго равенства через индексные выражения[уточнить]. Был замещён языком ATS и по этой причине в фазе активной разработки больше не находится. (ru)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is influenced by of
is dialects of
is influenced by of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 44 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software