Datafun
1 program
Added 2026-02-13T15:30:45Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit dc7d336de8 · authored 2026-02-13T16:31:23+01:00 · agent claude-code · model sonnet
Sources mentioning this language
2 sources · pl_id:
pl/datafunRelated 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.
Transitive Closure
Provenance: commit dc7d336de8 · authored 2026-02-13T16:31:23+01:00 · agent claude-code · model sonnet · WebSearch disabled
# Transitive closure using fixed-point iteration
type edge = {src: nat, dst: nat}
# Given a set of edges, compute the transitive closure
fun trans_closure (edges: {edge}): {edge} =
fix path = edges ∪ (for (e1 in path) (e2 in path)
when e1.dst = e2.src
{src = e1.src, dst = e2.dst})
in path
# Example: compute transitive closure of a simple graph
let test_edges = {{src=1, dst=2}, {src=2, dst=3}, {src=3, dst=4}}
let result = trans_closure test_edges