cicada
anders
| cicada | anders | |
|---|---|---|
| 9 | 3 | |
| 0 | 17 | |
| - | - | |
| 4.7 | 9.0 | |
| 5 days ago | about 1 month ago | |
| TypeScript | OCaml | |
| GNU General Public License v3.0 only | GNU General Public License v3.0 or later |
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.
cicada
-
Cicada – A FOSS, Cross-Platform Version of GitHub Actions and Gitlab CI
There is a collision in names:
Cicada, this CI tool, uses a DSL (domain specific language) to write configuration, and this DSL is referred to as "Cicada language", and blasted in marketing copy as a "real programming language" on https://cicada.sh/
However, this is a completely different language from Cicada language, a programming language and theorem prover hosted at https://cicada-lang.org/ and https://github.com/cicada-lang/cicada
This name collision is very confusing, and I wonder why Cicada the CI tool didn't just stick to python, since it is also a "real programming language"
- Cicada Language: A New Dependently Typed Language
- Ask HN: What technology is “cutting edge” in 2022?
-
Cicada Language -- A dependently typed programming language and a interactive theorem prover.
We have an issue about "Type: Type can lead to Russell's paradox": https://github.com/cicada-lang/cicada/issues/12
- A new programming language inspired by MIT's Scheme!
- Cicada Language (JavaScript with dependent type)
- Cicada Language
- GitHub - cicada-lang/cicada: a dependently typed programming language and interactive theorem prover.
anders
-
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?
awesome-rust-formalized-reasoning - An exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
cooltt - 😎TT
ttlite - A SuperCompiler for Martin-Löf's Type Theory
cubicaltt - Experimental implementation of Cubical Type Theory
inet-js - This is an implementation of interaction nets. It introduces you to the bizarre world of graph-based computation and linear logic, using a familiar JavaScript-like syntax :)
cicada - An old-school bash-like Unix shell written in Rust
Formality - A modern proof language [Moved to: https://github.com/kind-lang/Kind]
TSCPL - Moved to https://codeberg.org/mdwalters/TSCPL
sml-redprl - The People's Refinement Logic
cicada - A FOSS, cross-platform version of GitHub Actions and Gitlab CI
fathom - 🚧 (Alpha stage software) A declarative data definition language for formally specifying binary data formats. 🚧