{"id":19437850,"url":"https://github.com/wenkokke/firstorderunificationinagda","last_synced_at":"2026-02-11T12:04:56.970Z","repository":{"id":11928046,"uuid":"14496224","full_name":"wenkokke/FirstOrderUnificationInAgda","owner":"wenkokke","description":"Implementation of McBride's \"First-order unification by structural recursion\" in Agda.","archived":false,"fork":false,"pushed_at":"2018-10-08T22:19:58.000Z","size":13,"stargazers_count":8,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-08-24T15:37:38.492Z","etag":null,"topics":["first-order-unification","library","unification"],"latest_commit_sha":null,"homepage":null,"language":"Agda","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/wenkokke.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2013-11-18T15:23:58.000Z","updated_at":"2023-12-16T20:03:04.000Z","dependencies_parsed_at":"2022-08-30T14:41:03.713Z","dependency_job_id":null,"html_url":"https://github.com/wenkokke/FirstOrderUnificationInAgda","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/wenkokke/FirstOrderUnificationInAgda","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenkokke%2FFirstOrderUnificationInAgda","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenkokke%2FFirstOrderUnificationInAgda/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenkokke%2FFirstOrderUnificationInAgda/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenkokke%2FFirstOrderUnificationInAgda/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wenkokke","download_url":"https://codeload.github.com/wenkokke/FirstOrderUnificationInAgda/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenkokke%2FFirstOrderUnificationInAgda/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29332713,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-11T06:13:03.264Z","status":"ssl_error","status_checked_at":"2026-02-11T06:12:55.843Z","response_time":97,"last_error":"SSL_read: 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":["first-order-unification","library","unification"],"created_at":"2024-11-10T15:16:04.308Z","updated_at":"2026-02-11T12:04:56.953Z","avatar_url":"https://github.com/wenkokke.png","language":"Agda","funding_links":[],"categories":[],"sub_categories":[],"readme":"First-Order Unification in Agda\n===============================\n\nImplementation of Conor McBride's [First-order unification by structural recursion](http://journals.cambridge.org/action/displayFulltext?type=1\u0026fid=185140\u0026jid=JFP\u0026volumeId=13\u0026issueId=06\u0026aid=185139) in Agda.\n\nI'm personally using this implement proof search in Agda, but should you wish to use it\ndirectly you can do so as follows:\n\n    -- provide a datatype for the symbols and define a decidable equality\n    data Sym : ℕ → Set where\n      ADD  : Sym 3\n      SUC  : Sym 1\n      ZERO : Sym 0\n\n    decEqSym : ∀ {k} (f g : Sym k) → Dec (f ≡ g)\n    decEqSym ADD  ADD  = yes refl\n    decEqSym SUC  SUC  = yes refl\n    decEqSym ZERO ZERO = yes refl\n    \n    -- import and open the unification module\n    open import Unification Sym decEqSym\n\nIt uses version 0.7 of [the Agda \"Standard Library\"](http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Libraries.StandardLibrary).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwenkokke%2Ffirstorderunificationinagda","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwenkokke%2Ffirstorderunificationinagda","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwenkokke%2Ffirstorderunificationinagda/lists"}