cooltt
sml-redprl
Our great sponsors
| cooltt | sml-redprl | |
|---|---|---|
| 1 | 1 | |
| 208 | 225 | |
| -0.5% | - | |
| 5.7 | 10.0 | |
| 6 months ago | over 1 year ago | |
| OCaml | Standard ML | |
| Apache License 2.0 | MIT License |
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.
cooltt
-
Today, Thanks to this sub Reddit. I discovered 3 awesome new languages....
If you're looking for stuff pushing the boundaries of PL research, Agda (especially Cubical Agda) might be cool to look at. It's got lots of cutting edge stuff in it, pushing the boundaries of what is currently possible with dependent type theory. It's not the only language out there with cubical features (see also: cooltt), but it's probably one of the more fleshed-out implementations in terms of being practically useful. The 1Lab makes heavy use of it. There's also Introduction to Univalent Foundations of Mathematics with Agda that might be interesting to look at too!
sml-redprl
What are some alternatives?
redtt - "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
cubicaltt - Experimental implementation of Cubical Type Theory
effekt - A research language with effect handlers and lightweight effect polymorphism
xvm - Ecstasy and XVM
proofs - My personal repository of formally verified mathematics.
anders - 🧊 Модальний гомотопічний верифікатор математики
pony-tutorial - :horse: Tutorial for the Pony programming language
coq - Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
Agda - Agda is a dependently typed programming language / interactive theorem prover.