miso VS Agda

Patching jsaddle by applying this commit made JSaddle usable in Firefox for me, but it has the downside that preventDefault/stopPropagation no longer work (see this issue for more info).

Miso does support jsaddle, docs mention this under the "Live reload with jsaddle" section, although it could be more prominent.

For those interested in DOM-related benchmarks using GHCJS. Miso has some benchmarks here: https://krausest.github.io/js-framework-benchmark/current.html (Ctrl+F `miso`)

ghcjs is the way to go for you, and soon it might be asterius. i do not know how hard it is to set ghcjs up without a framework. but frameworks like obelisk (based on reflex-dom), shpadoinkle, and miso automate that for. i personally like obelisk for its functional reactive programming but it can get awkward and get in your way. so if gui programming is just a means to the end of this one small application and you are not really interested in it nor functional reactive programming, shpadoinkle or miso might suit you better. miso implements the elm architecture (also "TEA", "functional model view controller") and shpadoinkle implements something directly equivalent to the elm architecture. but shpadoinkle achieves more composable widgets by minimalizing the elm architecture. so i recommend shpadoinkle for its better concept although miso is more mature.

via ghcjs (miso, etc.)

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.

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.

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?

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.

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.

"Haskal is a mess, that's why I use a language that's written with Haskal."

Do it in Agda.

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

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

(For example, the standard dependent pair definition Σ, which is defined in Agda's core, does not have any).