{"id":19681943,"url":"https://github.com/higherorderco/kind2-archive","last_synced_at":"2025-04-05T14:10:02.561Z","repository":{"id":221567985,"uuid":"754727004","full_name":"HigherOrderCO/kind2-archive","owner":"HigherOrderCO","description":"Temporary repository for Kind2's refactor based on HVM2","archived":false,"fork":false,"pushed_at":"2024-09-25T13:32:31.000Z","size":1083,"stargazers_count":286,"open_issues_count":5,"forks_count":28,"subscribers_count":15,"default_branch":"master","last_synced_at":"2024-10-29T12:48:58.369Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Rust","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/HigherOrderCO.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":"2024-02-08T16:48:28.000Z","updated_at":"2024-10-15T08:39:55.000Z","dependencies_parsed_at":"2024-02-08T19:08:40.811Z","dependency_job_id":"eec13c42-d7b6-4023-9df2-126e019c76df","html_url":"https://github.com/HigherOrderCO/kind2-archive","commit_stats":{"total_commits":468,"total_committers":17,"mean_commits":"27.529411764705884","dds":0.5256410256410257,"last_synced_commit":"114ea8bf47d7d493b48035c072a25fb359cc0084"},"previous_names":["higherorderco/kind2"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HigherOrderCO%2Fkind2-archive","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HigherOrderCO%2Fkind2-archive/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HigherOrderCO%2Fkind2-archive/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HigherOrderCO%2Fkind2-archive/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/HigherOrderCO","download_url":"https://codeload.github.com/HigherOrderCO/kind2-archive/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247345856,"owners_count":20924102,"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-11-11T18:09:11.199Z","updated_at":"2025-04-05T14:10:02.538Z","avatar_url":"https://github.com/HigherOrderCO.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Kind2: a parallel proof \u0026 programming language\n\nKind2 is a minimalist proof language based on [Self\ntypes](https://cse.sc.edu/~pfu/document/papers/rta-tlca.pdf), a simple extension\nto the Calculus of Constructions that allows encoding inductive types without a\ncomplex, hardcoded datatype system. It compiles to\n[Bend](https://github.com/HigherOrderCO/Bend).\n\n## Usage\n\n1. Install [Rust](https://www.rust-lang.org/) and (optionally) [Haskell](https://www.haskell.org/) in your system.\n\n2. Clone this repository and install it:\n\n    ```\n    git clone https://github.com/HigherOrderCO/Kind2\n    cargo install --path .\n    ```\n\n3. Type-check a Kind2 definition:\n\n    ```\n    kind2 check name_here\n    ```\n\n4. Test it with the interpreter:\n\n    ```\n    kind2 run name\n    ```\n\n5. Compile and run in parallel, powered by HVM!\n\n    ```\n    kind2 compile name\n    ./name\n    ```\n\n## Examples\n\n```javascript\n// The Fibonacci function\nfib (n: U48) : U48 =\n  switch n {\n    0: 0\n    1: 1\n    _: (+ (fib (- n 1)) (fib (- n 2)))\n  }\n```\n\n### Datatypes (ADTs):\n\n```javascript\n// Polymorphic Lists\ndata List T\n| cons (head: T) (tail: (List T))\n| nil\n\n// Applies a function to all elements of a list\nmap \u003cA\u003e \u003cB\u003e (xs: (List A)) (f: A -\u003e B) : (List B) =\n  fold xs {\n    ++: (f xs.head) ++ xs.tail\n    []: []\n  }\n```\n\n### Theorems and Proofs:\n\n```javascript\nuse Nat/{succ,zero,half,double}\n\n// Proof that `∀n. n*2/2 = n`\nbft (n: Nat) : (half (double n)) == n =\n  match n {\n    succ: (Equal/apply succ (bft n.pred))\n    zero: {=}\n  }\n```\n\n### More Examples:\n\nThere are countless examples on the [`Book/`](book) directory.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhigherorderco%2Fkind2-archive","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhigherorderco%2Fkind2-archive","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhigherorderco%2Fkind2-archive/lists"}