SML/NJ
1 program
Added 2026-02-12T11:11:29Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: Standard ML of New Jersey, SML-NJ, SMLNJ
Provenance: commit fe75201f6a · authored 2026-02-12T12:12:16+01:00 · agent claude-code · model sonnet
Sources mentioning this language
3 sources · pl_id:
pl/standard-ml-of-new-jerseyWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Paradigms | multi-paradigm: functional · imperative |
|---|---|
| Typing | strong, static, inferred |
| Designed by | Bell Laboratories · Princeton University Lucent Technologies · Yale University (FLINT Project) · AT&T Research |
| First appeared | 1988 |
| Influenced by | Standard ML |
| License | BSD-like |
| Implemented in | Standard ML · C |
| Homepage | http://www.smlnj.org |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Quicksort Implementation
Provenance: commit fe75201f6a · authored 2026-02-12T12:12:16+01:00 · agent claude-code · model sonnet · WebSearch disabled
(* Quicksort implementation in Standard ML *)
fun quicksort [] = []
| quicksort (pivot::rest) =
let
val (less, greater) = List.partition (fn x => x < pivot) rest
in
quicksort less @ [pivot] @ quicksort greater
end;
(* Test the quicksort function *)
val test_list = [3, 7, 1, 9, 2, 8, 4, 6, 5];
val sorted = quicksort test_list;
print "Original list: ";
print (String.concatWith ", " (map Int.toString test_list));
print "\n";
print "Sorted list: ";
print (String.concatWith ", " (map Int.toString sorted));
print "\n";