Agda
ghc-proposals
Agda | ghc-proposals | |
---|---|---|
27 | 160 | |
2,371 | 672 | |
0.3% | 0.6% | |
9.8 | 9.2 | |
7 days ago | 5 days ago | |
Haskell | Python | |
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.
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 well-known 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 agda-mode
-
FP language idea - would this is possible to infer and type check?
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
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.
ghc-proposals
-
Functional Semantics in Imperative Clothing (Richard Feldman)
This is really just a matter of how much syntax sugar you want to implement. Idris has this already, and there’s a proposal to add it to Haskell too [0]. But none of this changes the core properties of the system which make it monadic.
[0] https://github.com/ghc-proposals/ghc-proposals/issues/527
-
An alternative front end for Haskell?
> I think Haskell needs a way to graduate (or retire) language extensions
https://github.com/ghc-proposals/ghc-proposals/pull/601
-
Or patterns proposal: Prefix signalling or just infix?
Additionally, while this proposal is focused on the simple implementation and so in the current proposal or patterns do not bind any variables as per #522, if we do get settled on syntax and then later wish to expand to allow binding variables as in #43, then the syntax is again clean and discoverable.
-
Monthly Hask Anything (May 2023)
Yeah, a relatively natural thing would be to be able to opt-in to having the HasField instances be available in all contexts. The (not yet implemented, but accepted) "Modifiers" GHC proposal might be nice for that.
-
Is there any way to build a simple additive prelude?
The local modules proposal imo is excellent as-is.
-
Interview and AMA with Simon Peyton Jones
Why would you drop TypeFamilies? It seems fairly popular, given that it was just one vote short of getting added to GHC2021. Do you consider it a less-ideal compromise, that is subsumed by your second proposal (Core with GRTT)?
-
Amendmend proposal: Changed syntax for Or patterns
as syntax is contentious a topic as ever, David (the main proposal author) and I would like to invite you to give your input on https://github.com/ghc-proposals/ghc-proposals/pull/585, where we propose to change the syntax of the accepted proposal #522 introducing Or patterns. In particular, we'd like to know
-
MSc Dissertation: Comprehending Pure Functional Effect Systems
This looks great, congratulations on completing it! I assume you didn’t get an opportunity to evaluate the delimited continuations based eff library? It would’ve been nice to see Cont included as one of the effects covered, though perhaps not available in all the systems you looked at? Maybe some future work.
-
Trouble understanding function import in Haskell
I do hope qualified exports are available someday: https://github.com/ghc-proposals/ghc-proposals/pull/283
-
{-# WARNING #-} for Data.List.{head,tail} in future GHC 9.8
Right. Being able to disable "custom type warnings" at use sites was part of an earlier proposal (https://github.com/ghc-proposals/ghc-proposals/pull/454) but it ended up being shelved.
What are some alternatives?
lean - Lean Theorem Prover
haskell-language-server - Official haskell ide support via language server (LSP). Successor of ghcide & haskell-ide-engine.
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.
ihp - 🔥 The fastest way to build type safe web apps. IHP is a new batteries-included web framework optimized for longterm productivity and programmer happiness
open-typerep - Open type representations and dynamic types
rio-orphans - A standard library for Haskell
HoleyMonoid - Automatically exported from code.google.com/p/monoid-cont
julia - The Julia Programming Language
distributive - Dual Traversable
hoogle - Haskell API search engine
agda-vim - Agda interaction in vim
ghc - Mirror of the Glasgow Haskell Compiler. Please submit issues and patches to GHC's Gitlab instance (https://gitlab.haskell.org/ghc/ghc). First time contributors are encouraged to get started with the newcomers info (https://gitlab.haskell.org/ghc/ghc/wikis/contributing).