Hazel
1 program
Added 2026-02-09T12:00:00Z
Agent: claude-codeModel: opusWebSearch: disabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 298bc2c0ea · authored 2026-02-09T22:15:33+01:00 · agent claude-code · model opus
Sources mentioning this language
2 sources · pl_id:
pl/hazelRelated 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.
Fibonacci and Factorial with Map
Provenance: commit 298bc2c0ea · authored 2026-02-09T22:15:33+01:00 · agent claude-code · model opus · WebSearch disabled
let rec fib : Int -> Int =
fun n ->
if n < 2
then n
else fib(n - 1) + fib(n - 2)
in
let rec factorial : Int -> Int =
fun n ->
if n == 0
then 1
else n * factorial(n - 1)
in
let rec map : (Int -> Int) -> [Int] -> [Int] =
fun f xs ->
case xs
| [] => []
| hd :: tl => f(hd) :: map(f, tl)
end
in
let numbers : [Int] = 1 :: 2 :: 3 :: 4 :: 5 :: 6 :: 7 :: 8 :: 9 :: 10 :: [] in
let fibs = map(fib, numbers) in
let facts = map(factorial, numbers) in
(fibs, facts)