|8 days ago||3 days ago|
|BSD 3-clause "New" or "Revised" License||LicenseRef-OtherLicense|
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.
How do you deal with GUI?
3 projects | reddit.com/r/haskell | 13 Jan 2022
via ghcjs (miso, etc.)
Anything like Svelte/Jetpack Compose for Haskell?
4 projects | reddit.com/r/haskell | 4 Dec 2021
I've built miso, https://haskell-miso.org and it does use the VDOM appraoch. Svelte uses static analysis to compile down to the minimum number of DOM operations required to run your specific app. I think it's the future. This would only be possible in Haskell w/ GHCJS, since you'd need the GHCJS runtime to support it.
What web framework would you recommend to a newbie at this time?
6 projects | reddit.com/r/haskell | 8 Nov 2021
Memory from finished thread is not getting reclaimed
Eventually, miso will maybe use haskell.nix directly by itself: https://github.com/dmjio/miso/pull/656
I don't know if it is relevant to you, but miso (both master and latest release) work just fine with GHCJS 8.10.
Other than that, I ran into a GHCJS and Miso bug, but they weren't too hard to solve.
When is Haskell the right choice?
4 projects | reddit.com/r/haskell | 26 Jan 2021
Miso works quite well if used through provided Nix derivations.
I solved collatz, but I have no idea how to write a paper.
2 projects | reddit.com/r/Collatz | 15 May 2022
Learn how to use a formal proof assistant. Coq and Agda are the most popular. Both allow you to write a proof as a program instead of as a paper, and provide various tools for formally checking your proof.
Eli5, What is a proof assistant
1 project | reddit.com/r/explainlikeimfive | 19 Mar 2022
Some programming languages are, https://github.com/agda/agda
Today, Thanks to this sub Reddit. I discovered 3 awesome new languages....
5 projects | reddit.com/r/ProgrammingLanguages | 13 Feb 2022
If you're looking for stuff pushing the boundaries of PL research, Agda (especially Cubical Agda) might be cool to look at. It's got lots of cutting edge stuff in it, pushing the boundaries of what is currently possible with dependent type theory. It's not the only language out there with cubical features (see also: cooltt), but it's probably one of the more fleshed-out implementations in terms of being practically useful. The 1Lab makes heavy use of it. There's also Introduction to Univalent Foundations of Mathematics with Agda that might be interesting to look at too!
Ask HN: What technology is “cutting edge” in 2022?
7 projects | news.ycombinator.com | 23 Jan 2022
Integer overflow causes Russel's paradox
1 project | news.ycombinator.com | 22 Dec 2021
What input method would you prefer for Unicode characters in a neovim plugin?
7 projects | reddit.com/r/agda | 18 Oct 2021
My best guess is that it has not really been maintained lately, there were only 12 commits in the last 7 years, some of which are just global modifications, which include this file as well: https://github.com/agda/agda/commits/136f85386ec43245745b76f03505bda4f5d1ed3f/src/full/Agda/Interaction/Highlighting/Vim.hs
Type in type and HoTT exercises
1 project | reddit.com/r/agda | 28 Aug 2021
Also I would suggest is that you import a paradox (e.g., https://github.com/agda/agda/blob/master/test/Succeed/Hurkens.agda) and see what it actually does when you construct values with it that you evaluate or proofs that you use.
Trouble with Proving Termination without K
2 projects | reddit.com/r/agda | 20 Jan 2021
Andrea had some code relaxing these restrictions at the last AIM (cf. "trying to make termination checker accept more definitions --without-K, fixing #4527" in the wrap-up section) but I don't know if it has been merged into master yet.
Road to 1.0/ Zig
2 projects | reddit.com/r/programming | 22 Dec 2020
Significant nit: this isn't true. The whole domain of "high-assurance software" is about this, with examples such as CompCert and seL4. There are tools like Frama-C that support you in proving things about your C; [proof assistants]() that let you extract Haskell, OCaml, or Scheme from proofs so the code is correct by construction; and languages like CakeML, F*, Agda, Idris, ATS... that are both programming languages and proof assistants.
What are some alternatives?
lean - Lean Theorem Prover
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
hevm - Dapp, Seth, Hevm, and more
adjunctions - Simple adjunctions
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
HoleyMonoid - Automatically exported from code.google.com/p/monoid-cont
distributive - Dual Traversable
open-typerep - Open type representations and dynamic types
psqueues - Priority Search Queues in three different flavors for Haskell
agda-vim - Agda interaction in vim
graphite - Haskell graphs and networks library