{"id":27310647,"url":"https://github.com/atticuskuhn/parallel-algorithms","last_synced_at":"2026-02-02T07:41:41.535Z","repository":{"id":167628061,"uuid":"624052568","full_name":"AtticusKuhn/parallel-algorithms","owner":"AtticusKuhn","description":"Proving the correctness and performance of certain parallel algorithms","archived":false,"fork":false,"pushed_at":"2023-08-12T03:39:06.000Z","size":114,"stargazers_count":4,"open_issues_count":1,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-07-04T19:06:48.695Z","etag":null,"topics":["agda","formal-methods","formal-verification","parallel-computing"],"latest_commit_sha":null,"homepage":"","language":"TeX","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/AtticusKuhn.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}},"created_at":"2023-04-05T16:36:28.000Z","updated_at":"2023-09-20T18:52:51.000Z","dependencies_parsed_at":"2023-07-08T03:31:52.543Z","dependency_job_id":"7a58c987-e13a-4068-8075-b5077d1efb28","html_url":"https://github.com/AtticusKuhn/parallel-algorithms","commit_stats":{"total_commits":23,"total_committers":1,"mean_commits":23.0,"dds":0.0,"last_synced_commit":"9ecf7b2ad41edd401e95120138056a216eebc076"},"previous_names":["atticuskuhn/parallel-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AtticusKuhn/parallel-algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AtticusKuhn%2Fparallel-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AtticusKuhn%2Fparallel-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AtticusKuhn%2Fparallel-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AtticusKuhn%2Fparallel-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AtticusKuhn","download_url":"https://codeload.github.com/AtticusKuhn/parallel-algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AtticusKuhn%2Fparallel-algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29007316,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-02T06:37:10.400Z","status":"ssl_error","status_checked_at":"2026-02-02T06:37:09.383Z","response_time":58,"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":["agda","formal-methods","formal-verification","parallel-computing"],"created_at":"2025-04-12T05:58:26.762Z","updated_at":"2026-02-02T07:41:41.512Z","avatar_url":"https://github.com/AtticusKuhn.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Parallel Algorithms\n\nThis is a project in denotational design, where I am using the proof-gramming language Agda in order to prove certain propositions\nabout parallel algorithms.\n\nI am using techniques from category theory such as closed cartesian categories to model these algorithms in order to make the proofs\nas elegent as I can.\n\n\nCurrently, I am proving propositions about a parallel tree reduction. Once I am done with that, I will possibly work\non parallel mergesort or parallel plus-scan.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fatticuskuhn%2Fparallel-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fatticuskuhn%2Fparallel-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fatticuskuhn%2Fparallel-algorithms/lists"}