{"id":47768235,"url":"https://github.com/chasenorman/canonical-min","last_synced_at":"2026-04-03T08:00:44.921Z","repository":{"id":341516549,"uuid":"1156775444","full_name":"chasenorman/Canonical-min","owner":"chasenorman","description":"A sound and complete solver for type inhabitation and unification in dependent type theory, written in 185 lines of Lean.","archived":false,"fork":false,"pushed_at":"2026-03-02T05:24:22.000Z","size":25,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-03-02T09:54:13.316Z","etag":null,"topics":["automated-reasoning","dependent-types","formal-methods","lean4","program-synthesis","theorem-prover","theorem-proving"],"latest_commit_sha":null,"homepage":"https://chasenorman.com","language":"Lean","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/chasenorman.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2026-02-13T03:16:59.000Z","updated_at":"2026-03-02T05:24:25.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/chasenorman/Canonical-min","commit_stats":null,"previous_names":["chasenorman/canonical-min"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/chasenorman/Canonical-min","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chasenorman%2FCanonical-min","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chasenorman%2FCanonical-min/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chasenorman%2FCanonical-min/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chasenorman%2FCanonical-min/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/chasenorman","download_url":"https://codeload.github.com/chasenorman/Canonical-min/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chasenorman%2FCanonical-min/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31342702,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-03T06:57:30.245Z","status":"ssl_error","status_checked_at":"2026-04-03T06:57:29.849Z","response_time":107,"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":["automated-reasoning","dependent-types","formal-methods","lean4","program-synthesis","theorem-prover","theorem-proving"],"created_at":"2026-04-03T08:00:20.154Z","updated_at":"2026-04-03T08:00:44.916Z","avatar_url":"https://github.com/chasenorman.png","language":"Lean","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Canonical-min\n\nCanonical-min is a sound and complete solver for type inhabitation and unification in dependent type theory, written in 185 lines of Lean. Canonical-min serves as a simplified reference for the algorithm behind [Canonical](github.com/chasenorman/Canonical), and a baseline for the development of future automated reasoning tools. A special feature of this implementation is the use of the *continuation monad* to convert the type checker into a constraint solver. \n\n## Project Structure\n\n- `Data.lean` — The definition of terms and types.\n- `Monad.lean` — The monadic framework to convert the type checker into a solver.\n- `Checker.lean` — The type checker.\n- `Search.lean` — The iterative deepening depth-first search. \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchasenorman%2Fcanonical-min","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchasenorman%2Fcanonical-min","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchasenorman%2Fcanonical-min/lists"}