{"id":17290554,"url":"https://github.com/squell/dunsel","last_synced_at":"2026-01-06T07:41:51.677Z","repository":{"id":26964716,"uuid":"30428005","full_name":"squell/dunsel","owner":"squell","description":"What else are functional languages for?","archived":false,"fork":false,"pushed_at":"2020-12-23T23:35:14.000Z","size":56,"stargazers_count":0,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-25T18:14:15.467Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Standard ML","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/squell.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-02-06T19:00:47.000Z","updated_at":"2020-12-23T23:35:17.000Z","dependencies_parsed_at":"2022-08-24T15:04:02.641Z","dependency_job_id":null,"html_url":"https://github.com/squell/dunsel","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/squell%2Fdunsel","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/squell%2Fdunsel/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/squell%2Fdunsel/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/squell%2Fdunsel/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/squell","download_url":"https://codeload.github.com/squell/dunsel/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245710810,"owners_count":20659970,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-15T10:38:33.257Z","updated_at":"2026-01-06T07:41:51.649Z","avatar_url":"https://github.com/squell.png","language":"Standard ML","funding_links":[],"categories":[],"sub_categories":[],"readme":"Code which serves no useful purpose\n===================================\n\n?aesh\n-----\nAn implementation of AES in straight Bourne Shell; speed is measures in 'seconds per block encrypted'. Still quite a nice and compact implementation, though!\n\nDespite Daan Sprenkels' efforts (see commit dae3df5ff72f02eec9063e203fcbe9249c2393f0), I am pretty sure this implementation is very far from being constant-time.\n\nbitslice\n--------\nAn example of bit-slicing as applied to a multiplication in GF(2^8), implementedin both C and assembly. Mainly to argue the point that doing it right in assembly (with macro's) is easier, more readable, and less error-prone than in C.\n\nconsttime\n---------\nConstant time implementations for stuff that you never knew needed constant-time implementations!\n\n* `memcmp` and `sort`\n* A C++ container class template with constant-time reversal\n\nfrege\n-----\nA 'trusted kernel'-type proof assistant for propositional logic in\nStandard ML, written during the course Proof Assistants. Comes in two\nflavours; with LCF-style tactics and Isabelle-style tactics.\n\nIt is also a deliberate and cynical attempt at mocking theorem provers.\n\nWhile the 'trusted kernel' of Frege is very small and simple, it\nonly knows negation and implication (hence its name!). Conjuction and\ndisjunction is translated into this in the usual way, their inference rules\nare proven, and the pretty printer has the ability to print them.\n\nThe result is a prover where non-obvious things will *seem to be proven*\nin the pretty printer. Or perhaps they actually *are proven*, but the\npretty-printer is part of the trusted kernel, too?\n\nIf none of this make sense, just read Logicomix, it is more fun.\n\ngoto\n----\nHaskell-implementations for the semantics of a WHILE-like language in\nvarious styles (Monads, Continuations); including an extension of WHILE\nwhich has scoped variables and jumps, where the semantics relies heavily on\nlazy evaluation and can produce some weird results.\n\nEssentially a cleaner expression (no pun intended) of the idea behind:\nhttp://cs.ru.nl/~M.Schoolderman/StdImperative/\n\niostream\n--------\nThree simple benchmarks to make the point that C++ iostreams are decrepit\nand horribly slow when used in the 'obvious' way. But that C++ streambufs\nare awesome.\n\nAt least in C++ '03.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsquell%2Fdunsel","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsquell%2Fdunsel","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsquell%2Fdunsel/lists"}