Oz
1 program
Added 2025-10-22T15:11:04Z
Model: anthropic/claude-4.5-sonnetTemp: 0.4
Evidence
Report issue
View issues
Aliases: Mozart/Oz, Mozart
Provenance: commit aab12beee2 · authored 2025-10-22T17:11:04+02:00 · model anthropic/claude-4.5-sonnet
Sources mentioning this language
8 sources · pl_id:
pl/ozWikipedia 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: logic · functional · imperative · object-oriented · constraint · distributed · concurrent |
|---|---|
| Typing | dynamic |
| Designed by | Mozart Consortium · Gert Smolka · his students |
| First appeared | 1991 |
| Influenced by | Erlang · Lisp · Prolog |
| License | MIT X11 |
| Homepage | http://mozart2.org |
Extensions claimed by this language
1 claim. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.oz | linguist | primary | 58.7K files |
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 Implementation in Oz
Provenance: commit aab12beee2 · authored 2025-10-22T17:11:04+02:00 · model anthropic/claude-4.5-sonnet · Temp 0.4
declare
fun {QuickSort Xs}
case Xs
of nil then nil
[] Pivot|Xr then
Left Right
in
{Partition Xr Pivot Left Right}
{Append {QuickSort Left} Pivot|{QuickSort Right}}
end
end
proc {Partition Xs Pivot ?Left ?Right}
Left = {Filter Xs fun {$ X} X < Pivot end}
Right = {Filter Xs fun {$ X} X >= Pivot end}
end
in
{Show {QuickSort [3 1 4 1 5 9 2 6 5 3 5]}}
{Show {QuickSort [8 7 6 5 4 3 2 1]}}
{Show {QuickSort [1]}}
{Show {QuickSort nil}}