fathom
🚧 (Alpha stage software) A declarative data definition language for formally specifying binary data formats. 🚧 (by yeslogic)
anders
🧊 Модальний гомотопічний верифікатор математики (by groupoid)
fathom | anders | |
---|---|---|
1 | 3 | |
257 | 17 | |
0.4% | - | |
0.0 | 9.0 | |
8 months ago | about 1 month ago | |
Rust | OCaml | |
Apache License 2.0 | GNU General Public License v3.0 or later |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
fathom
Posts with mentions or reviews of fathom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-16.
-
What's the project you're currently working on at your company as a Rust developer?
I’m working on Fathom: A declarative data definition language for formally specifying binary data formats. https://github.com/yeslogic/fathom
anders
Posts with mentions or reviews of anders.
We have used some of these posts to build our list of alternatives
and similar projects.
-
Anders CCHM/HTS Theorem Prover
Anders is HoTT theorem prover based on: classical MLTT-80 with 0, 1, 2, W types; CCHM in CHM flavour as cubical type system with hcomp/trans Kan operations; HTS sctrict equality on pretypes; de Rham stack modality primitives. We tend not to touch HIT yet, instead we will try to express as much HIT as possible through Coequlizer and HubSpokes Disc in the style of HoTT/Coq homotopy library and Three-HIT theorem. Written in OCaml https://github.com/groupoid/anders
- Show HN: Anders CCHM/HTS Theorem Prover
What are some alternatives?
When comparing fathom and anders you can also consider the following projects:
humility - Debugger for Hubris
cooltt - 😎TT
vector - A high-performance observability data pipeline.
cubicaltt - Experimental implementation of Cubical Type Theory
te - A parser, runtime and specification for the text expression language to make text processing human readable
cicada - An old-school bash-like Unix shell written in Rust
allsorts - Font parser, shaping engine, and subsetter implemented in Rust
Formality - A modern proof language [Moved to: https://github.com/kind-lang/Kind]
cxx-qt - Safe interop between Rust and Qt
sml-redprl - The People's Refinement Logic
te - C++17 Run-time polymorphism (type erasure) library
cicada - Cicada Language