Lazy ML
1 program
Added 2026-02-12T11:48:17.139638Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: LML
Provenance: commit 7a7df10b0f · authored 2026-02-12T12:49:34+01:00 · agent claude-code · model sonnet
Sources mentioning this language
3 sources · pl_id:
pl/lazy-mlRelated 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
Provenance: commit 7a7df10b0f · authored 2026-02-12T12:49:34+01:00 · agent claude-code · model sonnet · WebSearch disabled
-- Quicksort implementation in Lazy ML
-- This demonstrates lazy evaluation and pattern matching
fun quicksort [] = []
| quicksort (x::xs) =
let val smaller = filter (fn y => y < x) xs
val larger = filter (fn y => y >= x) xs
in
quicksort smaller @ [x] @ quicksort larger
end;
-- Filter function
fun filter p [] = []
| filter p (x::xs) =
if p x then x :: filter p xs
else filter p xs;
-- Example usage
val sorted = quicksort [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5];