Hope
1 program
Added 2025-10-28T06:45:21Z
Model: google/gemini-2.5-proTemp: 0.4
Evidence
Report issue
View issues
Aliases: —
Provenance: commit b9ac925f87 · authored 2025-10-28T07:45:21+01:00 · model google/gemini-2.5-pro
Sources mentioning this language
5 sources · pl_id:
pl/hopeWikipedia 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 | functional |
|---|---|
| Designed by | University of Edinburgh · Rod Burstall D. B. MacQueen Don Sannella |
| First appeared | 1980 |
| Influenced by | NPL |
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 and Insertion Sort in Hope
Provenance: commit b9ac925f87 · authored 2025-10-28T07:45:21+01:00 · model google/gemini-2.5-pro · Temp 0.4
module sort;
public qsort, isort;
dec qsort : list(num) -> list(num);
--- qsort(nil) <= nil;
--- qsort(x :: l) <= qsort(filter((<=x), l)) <> (x :: qsort(filter((>x), l)));
dec filter : (num->truval) # list(num) -> list(num);
--- filter(p, nil) <= nil;
--- filter(p, x::l) <= if p(x) then x::filter(p,l) else filter(p,l);
dec isort : list(num) -> list(num);
--- isort(nil) <= nil;
--- isort(x::l) <= insert(x, isort(l));
dec insert : num # list(num) -> list(num);
--- insert(x, nil) <= x::nil;
--- insert(x, y::l) <= if x<=y then x::y::l else y::insert(x,l);
end;