Standard ML - Programming language

Standard ML is a programming language created in 1990.

#133on PLDB

34Years Old

392kRepos

Standard ML (SML; Standard Meta Language) is a general-purpose, modular, functional programming language with compile-time type checking and type inference. It is popular among compiler writers and programming language researchers, as well as in the development of theorem provers. SML is a modern dialect of ML, the programming language used in the Logic for Computable Functions (LCF) theorem-proving project. Read more on Wikipedia...

Tags: programming language
There are at least 392,047 Standard ML repos on GitHub
Early development of Standard ML happened in Bell Labs and Princeton University
The Google BigQuery Public Dataset GitHub snapshot shows 2k users using Standard ML in 2k repos on GitHub
Standard ML appears in the TIOBE Index
Standard ML Ubuntu package
Pygments supports syntax highlighting for Standard ML
GitHub supports syntax highlighting for Standard ML
Standard ML appears in the Quine Relay project
Learn Standard ML on exercism.
sml-family.org was registered in 2014
See also: (19 related languages) Alice, DML, HOPE, Elm, F*, OCaml, Rust, Scala, ML, Caml, C, POPLOG, Pop-11, Common Lisp, Prolog, Emacs, Isabelle, Extended ML, F#
Read more about Standard ML on the web: 1.
11 PLDB concepts link to Standard ML: Elpi, invokator, jonprl, k-framework, mal, mlpolyr, MLscript, mythryl, Pygments, redprl, UrWeb

Example from Riju:

print "Hello, world!\n";

Example from hello-world:

fun hello() = print("Hello World\n");

hello()

Example from Linguist:

 
signature LAZY_BASE =
   sig
      type 'a lazy
      exception Undefined
      val force: 'a lazy -> 'a
      val delay: (unit -> 'a) -> 'a lazy
      val undefined: 'a lazy
   end

signature LAZY' =
   sig
      include LAZY_BASE
      val isUndefined: 'a lazy -> bool
      val inject : 'a -> 'a lazy
      val toString: ('a -> string) -> 'a lazy -> string
      val eq: ''a lazy * ''a lazy -> bool
      val eqBy: ('a * 'a -> bool) -> 'a lazy * 'a lazy -> bool
      val compare: ('a * 'a -> order) -> 'a lazy * 'a lazy -> order
      val map: ('a -> 'b) -> 'a lazy -> 'b lazy

      structure Ops:
                   sig
                      val ! : 'a lazy -> 'a (* force *)
                      val ? : 'a -> 'a lazy (* inject *)
                   end
   end

Example from Wikipedia:

- haar [1, 2, 3, 4, ~4, ~3, ~2, ~1];
   val it = [0,20,4,4,~1,~1,~1,~1]  : int list

Language features

Feature	Supported	Token
Print() Debugging	✓	print
Type Inference	✓
Semantic Indentation	X
Line Comments	X