ML
1 program
Added 2026-02-06T12:00:00Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: Meta Language
Provenance: commit a4fad97926 · authored 2026-02-06T10:01:42+01:00 · agent claude-code · model sonnet
Sources mentioning this language
5 sources · pl_id:
pl/mlWikipedia 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 · generic · imperative · interactive |
|---|---|
| Typing | inferred, static, strong |
| Designed by | Robin Milner · others at the University of Edinburgh |
| First appeared | 1973 |
| Influenced by | ISWIM · POP-2 · PAL · GEDANKEN |
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.
Functional Programming Examples
Provenance: commit a4fad97926 · authored 2026-02-06T10:01:42+01:00 · agent claude-code · model sonnet · WebSearch disabled
(* Factorial function in ML *)
fun factorial 0 = 1
| factorial n = n * factorial (n - 1);
(* Power function *)
fun power (x, 0) = 1
| power (x, n) = x * power (x, n - 1);
(* List operations *)
fun length [] = 0
| length (x::xs) = 1 + length xs;
fun sum [] = 0
| sum (x::xs) = x + sum xs;
(* Map function *)
fun map f [] = []
| map f (x::xs) = f x :: map f xs;
(* Filter function *)
fun filter p [] = []
| filter p (x::xs) =
if p x then x :: filter p xs
else filter p xs;
(* Example usage *)
val result1 = factorial 5;
val result2 = power (2, 10);
val result3 = length [1, 2, 3, 4, 5];
val result4 = sum [1, 2, 3, 4, 5];
val result5 = map (fn x => x * 2) [1, 2, 3, 4, 5];
val result6 = filter (fn x => x mod 2 = 0) [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];