This is the
talk page for discussing improvements to the
ML (programming language) article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google ( books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
![]() | This article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||
|
The article mixes ML the language and ML the language family. Standard ML already has its own article. What are references to the original ML language (definition, syntax, semantics, usage, ..)? —Preceding unsigned comment added by Joswig ( talk • contribs) 20:22, 15 February 2009 (UTC)
Can someone conversant in ML fix the example? It is a cut a paste from the Haskell article and contains some obvious errors. For example, there is reference made to the "third line" but the example is only two lines. Osmodiar 18:55, 13 January 2006 (UTC)
What's wrong with Basic?
Why is SML/NJ categorised under imperative programming languages?
The first line has a grammatical error. Since I don't know enough about the subject matter I'm unable to fix it. But the "and therefore..." clause is an incomplete sentence. 68.36.46.101 01:55, 19 October 2007 (UTC)
The following section was removed from the article
Boolean data type:
begin removed text
Like Ocaml,
ML has a bool
type that has true
and false
values. For example:
- fun isittrue x = if x then "YES" else "NO" ; > val isittrue = fn : bool -> string - isittrue true; > val it = "YES" : string - isittrue false; > val it = "NO" : string - isittrue (8=8); > val it = "YES" : string - isittrue (7=5); > val it = "NO" : string
end removed text
Is there a place for this text in the ML-related articles? Perhaps in the Wikibook? Thanks, and all the best, --
Jorge Stolfi (
talk) 23:47, 30 December 2009 (UTC)
ML is a declarative language (source: [1] Page 13) as opposed to imperative as per the information on the wiki page.
{{
cite book}}
: |edition=
has extra text (
help)
Are they seriously demonstrating the factorial function and *not* calling it "fun fact"? We need to change that on the double. Can I get an amen? — Preceding unsigned comment added by 206.21.122.76 ( talk) 07:39, 4 December 2013 (UTC)
The original ML was quite a different language. Type inference has always been a part of ML but there was no pattern matching, records, modules, or datatype declarations. I wouldn't expect to read BCPL and find examples written in C++11 either. Cooksbard90 ( talk) 20:42, 7 March 2015 (UTC)
The concept of "meta language" is different from this specific language. I suggest a disambiguation note near the top. It would be comparable to having a language named "Compiler" (capital "C"). The concept of "compiler" exists outside of such a hypothetical language. 146.233.255.212 ( talk) 22:13, 24 February 2021 (UTC)
Q: Yes or No, and why? slbtty ( talk) 07:01, 5 October 2021 (UTC)
A: Haskell is not an ML. It is non-strict, where ML is strict. It is pure, where ML is impure. It uses typeclasses and not modules. It has a similar type system but otherwise is very different, and indeed one of the motivations for Haskell was to explore strongly-typed functional programming in ways that ML had not. There is a lot of respect for ML in the Haskell community, but the answer is clearly `no`.
ML has a rich history, and it is well-documented. I'm not good at wikipedia, so I'll leave the links here for someone else to take all the glory.
Here's the original paper: http://www-public.it-sudparis.eu/~gibson/Teaching/CSC4504/ReadingMaterial/GordonMMNW78.pdf
Here's a good history, with lots of citations, from 2020: https://smlfamily.github.io/history/SML-history.pdf — Preceding unsigned comment added by 2600:8800:6182:4990:0:0:0:13FD ( talk) 23:13, 18 June 2022 (UTC)
This is the
talk page for discussing improvements to the
ML (programming language) article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google ( books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
![]() | This article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||
|
The article mixes ML the language and ML the language family. Standard ML already has its own article. What are references to the original ML language (definition, syntax, semantics, usage, ..)? —Preceding unsigned comment added by Joswig ( talk • contribs) 20:22, 15 February 2009 (UTC)
Can someone conversant in ML fix the example? It is a cut a paste from the Haskell article and contains some obvious errors. For example, there is reference made to the "third line" but the example is only two lines. Osmodiar 18:55, 13 January 2006 (UTC)
What's wrong with Basic?
Why is SML/NJ categorised under imperative programming languages?
The first line has a grammatical error. Since I don't know enough about the subject matter I'm unable to fix it. But the "and therefore..." clause is an incomplete sentence. 68.36.46.101 01:55, 19 October 2007 (UTC)
The following section was removed from the article
Boolean data type:
begin removed text
Like Ocaml,
ML has a bool
type that has true
and false
values. For example:
- fun isittrue x = if x then "YES" else "NO" ; > val isittrue = fn : bool -> string - isittrue true; > val it = "YES" : string - isittrue false; > val it = "NO" : string - isittrue (8=8); > val it = "YES" : string - isittrue (7=5); > val it = "NO" : string
end removed text
Is there a place for this text in the ML-related articles? Perhaps in the Wikibook? Thanks, and all the best, --
Jorge Stolfi (
talk) 23:47, 30 December 2009 (UTC)
ML is a declarative language (source: [1] Page 13) as opposed to imperative as per the information on the wiki page.
{{
cite book}}
: |edition=
has extra text (
help)
Are they seriously demonstrating the factorial function and *not* calling it "fun fact"? We need to change that on the double. Can I get an amen? — Preceding unsigned comment added by 206.21.122.76 ( talk) 07:39, 4 December 2013 (UTC)
The original ML was quite a different language. Type inference has always been a part of ML but there was no pattern matching, records, modules, or datatype declarations. I wouldn't expect to read BCPL and find examples written in C++11 either. Cooksbard90 ( talk) 20:42, 7 March 2015 (UTC)
The concept of "meta language" is different from this specific language. I suggest a disambiguation note near the top. It would be comparable to having a language named "Compiler" (capital "C"). The concept of "compiler" exists outside of such a hypothetical language. 146.233.255.212 ( talk) 22:13, 24 February 2021 (UTC)
Q: Yes or No, and why? slbtty ( talk) 07:01, 5 October 2021 (UTC)
A: Haskell is not an ML. It is non-strict, where ML is strict. It is pure, where ML is impure. It uses typeclasses and not modules. It has a similar type system but otherwise is very different, and indeed one of the motivations for Haskell was to explore strongly-typed functional programming in ways that ML had not. There is a lot of respect for ML in the Haskell community, but the answer is clearly `no`.
ML has a rich history, and it is well-documented. I'm not good at wikipedia, so I'll leave the links here for someone else to take all the glory.
Here's the original paper: http://www-public.it-sudparis.eu/~gibson/Teaching/CSC4504/ReadingMaterial/GordonMMNW78.pdf
Here's a good history, with lots of citations, from 2020: https://smlfamily.github.io/history/SML-history.pdf — Preceding unsigned comment added by 2600:8800:6182:4990:0:0:0:13FD ( talk) 23:13, 18 June 2022 (UTC)