{"id":25042764,"url":"https://github.com/aerkiaga/nacre","last_synced_at":"2025-10-25T12:46:35.614Z","repository":{"id":274928633,"uuid":"888054371","full_name":"aerkiaga/nacre","owner":"aerkiaga","description":"A programming language for verified software.","archived":false,"fork":false,"pushed_at":"2025-03-04T20:54:48.000Z","size":334,"stargazers_count":0,"open_issues_count":5,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-30T13:04:39.255Z","etag":null,"topics":["compiler","formal-verification","programming-language"],"latest_commit_sha":null,"homepage":"","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/aerkiaga.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,"zenodo":null}},"created_at":"2024-11-13T18:24:54.000Z","updated_at":"2025-03-05T00:46:08.000Z","dependencies_parsed_at":"2025-02-17T21:23:59.695Z","dependency_job_id":"014ae9a6-839c-401e-90e7-b96a445573d1","html_url":"https://github.com/aerkiaga/nacre","commit_stats":null,"previous_names":["aerkiaga/nacre"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/aerkiaga/nacre","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aerkiaga%2Fnacre","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aerkiaga%2Fnacre/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aerkiaga%2Fnacre/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aerkiaga%2Fnacre/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aerkiaga","download_url":"https://codeload.github.com/aerkiaga/nacre/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aerkiaga%2Fnacre/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269787953,"owners_count":24475857,"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","status":"online","status_checked_at":"2025-08-10T02:00:08.965Z","response_time":71,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["compiler","formal-verification","programming-language"],"created_at":"2025-02-06T04:47:12.808Z","updated_at":"2025-09-16T13:20:23.228Z","avatar_url":"https://github.com/aerkiaga.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Nacre\nA programming language for verified software.\n\n## Usage\nType in the workspace directory:\n\n```shell\ncargo run nacre::std::logic::Eq::symmetric\n```\n\nThis will verify `Eq::symmetric` in `./nacre/std/logic.na`.\nTo verify any theorem of yours, type it in a file\nand access its path like this. You can import symbols\nfrom `std` using the following syntax:\n\n```rust\nuse super::nacre::std::logic::Eq;\n```\n\nTo use `annotate-snippets` for error reporting\ninstead of `ariadne` (the default), pass the\n`--features annotate-snippets` and `--no-default-features`\nflags to `cargo`.\n\nAt the moment, code generation is very\nbasic and the ABI is not complete.\nThere is an integration test for compilation,\nwhich emits an object file and links it\nagainst a test program, which is then run.\n\n## Testing\n```shell\ncargo check         # build\ncargo clippy        # linter\ncargo test          # integration tests\ncargo llvm-cov      # test coverage\ncargo bench         # performance regressions\ncargo mutants --test-workspace true       # mutation testing\n```\n\n### Fuzz testing\n```shell\ncargo afl build --example fuzz_consistency\ncargo afl fuzz -i nacre_kernel/examples/in -o nacre_kernel/examples/out target/debug/examples/fuzz_consistency\n```\n\n## Roadmap\n### Early bootstrapping phase\nCurrently, a compiler is being developed in Rust,\nbut the roadmap is focused on eventual self-hosting.\nThis means that this initial development will focus\non _correctness_ and _core_ features, but not\nnecessarily performance or even code quality\n(although readable code is desired, so as to serve\nas reference for later development).\n\n* Complete and stabilize code generation.\n  - Structs and enum variants with contents.\n  - Built-in operators.\n  - Array and integer types.\n  - Generic types (and related CoC-level transformations).\n  - Partial application.\n  - Non-de-closureable usages.\n* Finish core syntax.\n  - Implement named parameters in function application.\n  - Implement struct and enum definition syntax.\n  - Add support for more kinds of lvalues.\n  - Add core operators.\n* Add tests.\n  - Parser fuzz test.\n  - Regular test suite.\n  - Mutation testing.\n\n### Research phase\nOnce the bootstrapping compiler is capable of\ngenerating actual (albeit slow) code, the next\nstep would be to carefully expand its capabilities\nand the standard library, working towards the\nimplementation of a self-hosting compiler.\n\n* Implement macros.\n  - Design the macro system.\n  - Get JIT compilation ready.\n  - Get basic macros to a working state.\n* Improve logical foundation.\n  - Allow axioms from allowlisted paths.\n  - Explore if a generalized induction axiom can be\n    expressed and used in a reasonable way.\n  - Explore whether axiomatization of type-specific\n    indefinite description is consistent and sufficient\n    to prove the types' uniqueness.\n  - Investigate what types should be given this\n    axiomatization at minimum (e.g. equality).\n  - Write axioms.\n* Extend the standard library.\n* Implement low-hanging optimizations.\n\n### Self-hosting compiler development\nHaving brought the compiler and language to\na reasonable degree of maturity, the most critical\ntask begins: writing a self-hosting compiler\nwith all the desired features, performance\nand optimization capabilities.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faerkiaga%2Fnacre","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faerkiaga%2Fnacre","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faerkiaga%2Fnacre/lists"}