fgl
Agda
Our great sponsors
 InfluxDB  Access the most powerful time series database as a service
 ONLYOFFICE ONLYOFFICE Docs β document collaboration in your environment
 SonarLint  Clean code begins in your IDE with SonarLint
fgl  Agda  

5  24  
176  2,113  
0.6%  1.1%  
0.0  9.8  
4 months ago  3 days ago  
Haskell  Haskell  
BSD 3clause "New" or "Revised" License  LicenseRefOtherLicense 
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

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.

π 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

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 agdamode

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, classbased 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).
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 semiinteractive development of machinechecked proofs.
opentyperep  Open type representations and dynamic types
HoleyMonoid  Automatically exported from code.google.com/p/monoidcont
zig  Generalpurpose programming language and toolchain for maintaining robust, optimal, and reusable software.
distributive  Dual Traversable
agda.nvim  NeoVim plugin for interacting with Agda written in Lua
miso  :ramen: A tasty Haskell frontend framework
eliminators  Dependently typed elimination functions using singletons
agdavim  Agda interaction in vim
psqueues  Priority Search Queues in three different flavors for Haskell
agdaplayground