fgl
Agda
fgl  Agda  

5  27  
184  2,403  
0.5%  1.3%  
6.6  9.8  
2 months ago  6 days ago  
Haskell  Haskell  
BSD 3clause "New" or "Revised" License  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.
fgl

Nary Tree data structure with efficient parent access?
Your names are good, I reckon it is Martin Erwig's fgl stuff and Andrey Mokhov's algebraicgraphs that you have in mind.

Library for Treelike data structure
I am about to start a new project in Haskell, model checking with (new) treelike 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.

Want to start a new project and I'm wondering if Haskell is the right tool for it
Couple of approaches to graphs that are statefree: functional graphs and algebraic graphs

π 2021 Day 12 Solutions π
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 builtin for "traversal with revisiting".

π 2021 Day 9 Solutions π
For part 2, instead of trying to unionmerge 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.
Agda

Types versus sets (and what about categories?)
This was recently deemed inappropriate:
"Bye bye Set"
"Set and Prop are removed as keywords"
https://github.com/agda/agda/pull/4629

If given a list of properties/definitions and relationship between them, could a machine come up with (mostly senseless, but) true implications?
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?
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 wellknown but is very cool.

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?

Functional Programming and Maths <> How can a code monkey learn Agda?
That's absolutely untrue. From the horse's mouth:
 Doom emacs and agdamode

FP language idea  would this is possible to infer and type check?
Agda has the socalled mixfix operators (which are powerful enough to cover pre/in/postfix cases with an arbitrary number of arguments), check that out:  https://agda.readthedocs.io/en/v2.6.1/language/mixfixoperators.html  https://github.com/agda/agda/blob/master/examples/Introduction/Operators.agda  https://github.com/agda/agdastdlib/blob/master/src/Data/Product/Base.agda

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.
What are some alternatives?
adjunctions  Simple adjunctions
lean  Lean Theorem Prover
psqueues  Priority Search Queues in three different flavors for Haskell
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 semiinteractive development of machinechecked proofs.
distributive  Dual Traversable
opentyperep  Open type representations and dynamic types
ethereumclienthaskell
HoleyMonoid  Automatically exported from code.google.com/p/monoidcont
miso  :ramen: A tasty Haskell frontend framework
heaps  Asymptotically optimal Brodal/Okasaki heaps
lean4  Lean 4 programming language and theorem prover