{"id":16313717,"url":"https://github.com/jacquescarette/theoriesanddatastructures","last_synced_at":"2026-01-23T12:55:46.551Z","repository":{"id":108701723,"uuid":"90783305","full_name":"JacquesCarette/TheoriesAndDataStructures","owner":"JacquesCarette","description":"Showing how some simple mathematical theories naturally give rise to some common data-structures","archived":false,"fork":false,"pushed_at":"2024-06-13T17:48:21.000Z","size":13346,"stargazers_count":39,"open_issues_count":1,"forks_count":2,"subscribers_count":9,"default_branch":"master","last_synced_at":"2025-07-13T10:30:24.940Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Agda","has_issues":true,"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/JacquesCarette.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-05-09T19:19:14.000Z","updated_at":"2025-05-26T03:52:44.000Z","dependencies_parsed_at":"2024-11-06T08:36:11.618Z","dependency_job_id":"bb0cc90c-e360-4ce6-9410-4847863e44b8","html_url":"https://github.com/JacquesCarette/TheoriesAndDataStructures","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"purl":"pkg:github/JacquesCarette/TheoriesAndDataStructures","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JacquesCarette%2FTheoriesAndDataStructures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JacquesCarette%2FTheoriesAndDataStructures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JacquesCarette%2FTheoriesAndDataStructures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JacquesCarette%2FTheoriesAndDataStructures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JacquesCarette","download_url":"https://codeload.github.com/JacquesCarette/TheoriesAndDataStructures/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JacquesCarette%2FTheoriesAndDataStructures/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28692394,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-23T11:01:27.039Z","status":"ssl_error","status_checked_at":"2026-01-23T11:00:26.909Z","response_time":59,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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-10T21:52:07.204Z","updated_at":"2026-01-23T12:55:46.519Z","avatar_url":"https://github.com/JacquesCarette.png","language":"Agda","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1\u003e TheoriesAndDataStructures \u003c/h1\u003e\n\nShowing how some simple mathematical theories naturally give rise to some common data-structures.\n\nAttempting to answer the following questions:\n\n-   Why do lists pop-up more frequently to the average programmer than, say, their duals: bags?\n\n-   More simply, why do unit and empty types occur so naturally? What about enumerations/sums and records/products?\n\n-   Why is it that dependent sums and products do not pop-up expicitly to the average programmer? They arise naturally all the time as tuples and as classes.\n\n-   How do we get the usual toolbox of functions and helpful combinators for a particular data type? Are they \\`\\`built into'' the type?\n\n-   Is it that the average programmer works in the category of classical Sets,   with functions and propositional equality? Does this result in some \\`\\`free constructions'' not easily made computable since mathematicians usually work in the category of Setoids but tend to quotient to arrive in \\`Sets\\` \u0026#x2014;where quotienting is not computably feasible, in \\`Sets\\` at-least; and why is that?\n\nAnd lots of other stuff.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjacquescarette%2Ftheoriesanddatastructures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjacquescarette%2Ftheoriesanddatastructures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjacquescarette%2Ftheoriesanddatastructures/lists"}