klister VS reanimate

Yeah, that project is pretty much at the bottom of my list, unfortunately. My top projects these days are mgmt, klister, recursion-schemes, and hint... And that's already too much!

case is a special form, ie a bit of core syntax, but, interestingly, data is not. (It is presumably a macro; typechecking is actually done as a part of macro expansion.) The syntax remains pretty uniform. Or, in Klister, type ascription is done via normal S-expression syntax with a form called the, as (the $type $expression); again, the syntax is uniform.

Shameless plug: we don't have that problem in Klister, because our equivalent to main is a run macro which runs an IO action, and your alternate prelude can define its own run macro which expects an IO action from your alternate prelude.

Klister is very similar to Hackett, but implemented in Haskell instead of Racket, and my most recent PR is from 20 days ago, if that's the metric which counts for you. Still very much of a WIP though.

You might be interested in Klister: https://github.com/gelisam/klister

I've now also found an implementation for klister, which is meant to interleave type checking with macro expansion.

In Klister, which already has Scheme-like macros and Haskell-like types (polymorphism, algebraic types and higher-kinded types, but not yet fancier types like RankNTypes and GADTs), our plan to get the best of both worlds (lexical syntax and typed ASTs) is to separate parsing from macro evaluation. That is, users write their programs using the surface syntax of s-expressions, parsers parse those into typed ASTs, and macros are typed by the type of the ASTs they receive as input and produce as output. At this stage this is only a research idea, I don't know if that's going to work out yet, but I hope so!

Reanimate sounds almost ideal, with its support for LaTeX. But unfortunately, it is all rendered in batch, not providing for any interactivity.

Is this the discussion you're referring to? https://github.com/reanimate/reanimate/discussions/210

It's actually pretty interesting to read. The author makes a not totally unreasonable argument as for why it uses unsafePerformIO.

Now what I'm really curious about is why the very first example on the site I clicked into the source code for, a simple 59-line example, is using unsafePerformIO. That actually worries me more because it suggests that as a user I might have to use unsafePerformIO. https://github.com/reanimate/reanimate/blob/d4d3898831edb4aa...

Not really dashboard library, but reanimate is a good library for this kind of stuff.

Some other "applications" (if you're not interested in compilers) might be writing shell scripts: https://hackage.haskell.org/package/turtle Or animating stuff: https://github.com/reanimate/reanimate and https://hackage.haskell.org/package/gloss

That aside, it seems that svg-tree doesn’t support filter elements, so I recommend reanimate-svg. You can join the Discord server for Reanimate and ask for help. Good luck.

See also reanimate, a very similar Haskell library: https://reanimate.github.io/

This is very niche, but something I've wanted to do for a while is to generate some cool physics example on the surface of a sphere with https://hackage.haskell.org/package/hamilton, and display it with https://reanimate.github.io/ (using https://hackage.haskell.org/package/linear for the projection)

Hi u/Target_Organic, I wich you a warm welcome! Haskell is often very satisfying to work with, it has a sense of beauty in it. Regarding your questions: 1. I never had big problems about performance. However, I personally place more emphasis about correctness, simplicity and readability of my programs. Performance tuning comes after. 2. For graphic libraries, I know diagrams, Reanimate and Haskell-chart. Since you seems interested by mathematical approach to graphics, I think you will find happiness there. 3. I'm not sure about the AI field. Other, more practical languages such as Python seems to have taken the lead. What is sure for me, that Machine Learning/NN would be nicely describe in Haskell with solid foundations.