Agda
Agda is a dependently typed programming language / interactive theorem prover. (by agda)
HoleyMonoid
Automatically exported from code.google.com/p/monoid-cont (by MedeaMelana)
Our great sponsors
- InfluxDB - Access the most powerful time series database as a service
- ONLYOFFICE ONLYOFFICE Docs — document collaboration in your environment
- SonarQube - Static code analysis for 29 languages.
| Agda | HoleyMonoid | |
|---|---|---|
| 24 | 0 | |
| 2,113 | 6 | |
| 2.1% | - | |
| 9.8 | 0.0 | |
| 1 day ago | over 6 years ago | |
| Haskell | Haskell | |
| GNU General Public License v3.0 or later | BSD 3-clause "New" or "Revised" License |
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.
Agda
Posts with mentions or reviews of Agda.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-05-08.
-
What are the current hot topics in type theory and static analysis?
Most of the proof assistants out there: Lean, Coq, Dafny, Isabelle, F*, Idris 2, and Agda. And the main concepts are dependent types, Homotopy Type Theory AKA HoTT, and Category Theory. Warning: HoTT and Category Theory are really dense, you're going to really need to research them.
-
Amendmend proposal: Changed syntax for Or patterns
Does this come with plans to separately unify the body with each of the contexts induced by matching on each of the respective patterns (similar to what’s discussed here), or will it behave like the _ pattern and use only the most general context?
- Doom emacs and agda-mode
-
Best Programming Language for Computational Proof
Coq, Agda, Lean, Isabelle, and probably some others which are not coming to my mind at the moment, but those would be considered the major ones.
-
Do you use Idris or Coq, and why?
Funny that you say this, because there are some obvious long standing open feature requests with looking up the type of the term under cursor — № 4295 and № 516. I am not blaming anyone in particular — this is the way it is. I wish I could find time to rewrite the proof search engine (how hard can it be), but I am already buried under a pile of other commitments and a good chunk of overwhelming sadness.
-
Haskell is the greatest programming language of all time ... the rational adult in a room full of children ... When I program in Haskell, I am in utopia. I am in a different world than 99.9% of what I see posted on Reddit.
"Haskal is a mess, that's why I use a language that's written with Haskal."
-
The comment with the most upvotes decides what language I write my finals in this year will be.
Do it in Agda.
-
Wren is a small, fast, class-based concurrent scripting language
Agda is fun[1]. And there's also Idris[2] - more programming language, less proof assistant.
[1] https://wiki.portal.chalmers.se/agda/pmwiki.php https://github.com/agda/agda
-
Do you feel static types have "won the war", so to speak?
At the most extreme level, you disappear into a meditative solitary retreat for a couple of years to seek enlightenment, and when you emerge you're no longer a programmer who writes programs, you're a theorist who proves theorems in Agda, and you have transcended above things that are tainted by the inherent evil of the material plane like "side effects" and "business needs" and "delivery timelines" and "could you stop doing that fancy math crap and just change the button's color like I asked for".
-
Can I write Agda using only ASCII characters?
(For example, the standard dependent pair definition Σ, which is defined in Agda's core, does not have any).
HoleyMonoid
Posts with mentions or reviews of HoleyMonoid.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning HoleyMonoid yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing Agda and HoleyMonoid you can also consider the following projects:
lean - Lean Theorem Prover
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.
open-typerep - Open type representations and dynamic types
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
fgl - A Functional Graph Library for Haskell
distributive - Dual Traversable
agda.nvim - NeoVim plugin for interacting with Agda written in Lua
miso - :ramen: A tasty Haskell front-end framework
eliminators - Dependently typed elimination functions using singletons
agda-vim - Agda interaction in vim
agda-playground
permutation - git import of patrick perry permutations lib from darcs