|5 days ago||3 months ago|
|LicenseRef-OtherLicense||BSD 3-clause "New" or "Revised" 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.
If given a list of properties/definitions and relationship between them, could a machine come up with (mostly senseless, but) true implications?
5 projects | /r/math | 11 Jul 2023
Still, there are many useful tools based on these ideas, used by programmers and mathematicians alike. What you describe sounds rather like Datalog (e.g. Soufflé Datalog), where you supply some rules and an initial fact, and the system repeatedly expands out the set of facts until nothing new can be derived. (This has to be finite, if you want to get anywhere.) In Prolog (e.g. SWI Prolog) you also supply a set of rules and facts, but instead of a fact as your starting point, you give a query containing some unknown variables, and the system tries to find an assignment of the variables that proves the query. And finally there is a rich array of theorem provers and proof assistants such as Agda, Coq, Lean, and Twelf, which can all be used to help check your reasoning or explore new ideas.
What can Category Theory do?
2 projects | /r/askmath | 22 Jun 2023
Haskell and Agda are probably the most obvious examples. Ocaml too, but it is much older, so its type system is not as categorical. There is also Idris, which is not as well-known but is very cool.
What are the current hot topics in type theory and static analysis?
15 projects | /r/ProgrammingLanguages | 8 May 2023
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
2 projects | /r/haskell | 14 Apr 2023
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
2 projects | /r/emacs | 22 Mar 2023
Best Programming Language for Computational Proof
3 projects | /r/math | 21 Jan 2023
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?
3 projects | /r/haskell | 16 Nov 2022
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.
2 projects | /r/programmingcirclejerk | 2 Nov 2022
"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.
14 projects | /r/ProgrammerHumor | 17 Sep 2022
Do it in Agda.
Wren is a small, fast, class-based concurrent scripting language
11 projects | news.ycombinator.com | 28 Aug 2022
Library for Tree-like data structure
2 projects | /r/haskell | 3 Oct 2022
I am about to start a new project in Haskell, model checking with (new) tree-like data structures. I think it is best to start building on a library such that i can already have elegant base functions, yet i am wondering what library is currently the standard? I read about fgl ( https://hackage.haskell.org/package/fgl ), yet it is a very old library.
-🎄- 2021 Day 12 Solutions -🎄-
145 projects | /r/adventofcode | 11 Dec 2021
Using fgl but only as a data structure this time, with edge labels denoting whether the target is a big room. Not using any of its algorithms as it doesn't have anything built-in for "traversal with re-visiting".
-🎄- 2021 Day 9 Solutions -🎄-
185 projects | /r/adventofcode | 8 Dec 2021
For part 2, instead of trying to union-merge from the lowest points, I simply found all connected regions of <9. I say "simply" because I just threw things at fgl, but setting the graph up first took a bit of work. buildGr is fast but picky about the exact order things come in with.
What are some alternatives?
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
HoleyMonoid - Automatically exported from code.google.com/p/monoid-cont
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
distributive - Dual Traversable
miso - :ramen: A tasty Haskell front-end framework
agda-vim - Agda interaction in vim
eliminators - Dependently typed elimination functions using singletons
agda.nvim - NeoVim plugin for interacting with Agda written in Lua
psqueues - Priority Search Queues in three different flavors for Haskell
adjunctions - Simple adjunctions