Agda VS agda-unused

Agda

• Types versus sets (and what about categories?)
  1 project | news.ycombinator.com | 31 Aug 2023

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

• Functional Programming and Maths <|> How can a code monkey learn Agda?
  1 project | /r/functionalprogramming | 26 Mar 2023

  That's absolutely untrue. From the horse's mouth:

• Doom emacs and agda-mode
  2 projects | /r/emacs | 22 Mar 2023
• FP language idea - would this is possible to infer and type check?
  1 project | /r/haskell | 26 Jan 2023

  Agda has the so-called 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/mixfix-operators.html - https://github.com/agda/agda/blob/master/examples/Introduction/Operators.agda - https://github.com/agda/agda-stdlib/blob/master/src/Data/Product/Base.agda

• 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.

agda-unused

We haven't tracked posts mentioning agda-unused yet.
Tracking mentions began in Dec 2020.