fgl VS Agda

Compare fgl vs Agda and see what are their differences.

fgl

A Functional Graph Library for Haskell (by haskell)

Agda

Agda is a dependently typed programming language / interactive theorem prover. (by 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 3-clause "New" or "Revised" License LicenseRef-OtherLicense
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.

fgl

Posts with mentions or reviews of fgl. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-10-03.
  • Library for Tree-like data structure
    2 projects | reddit.com/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 | reddit.com/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 | reddit.com/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.

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 some alternatives?

When comparing fgl and Agda 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

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

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

psqueues - Priority Search Queues in three different flavors for Haskell

agda-playground