A modern programming language that makes developers happier.

kotlinlang

<@U0BA5R9KL> looking at <https://github.com/breandan/kaliningraph> (again). Looks superb and documentation is the best as always.

Hi <@U5F0TT0UX>, thanks for the shout out! It’s just a research prototype right now, but I released it in case anyone else wants to play around with graphs or share feedback. It’s based on some ideas in algebra and inductive graph processing, there is a good paper I recently discovered that summarizes our approach pretty well. Although it’s written in Haskell, the approach translates pretty well to other languages. <https://github.com/snowleopard/alga-paper/releases/download/final/algebraic-graphs.pdf|https://github.com/snowleopard/alga-paper/releases/download/final/algebraic-graphs.pdf> 

I also wrote about some of those ideas here in case anyone is interested: <http://breandan.net/2020/06/30/graph-computation/#graphs-inductively|http://breandan.net/2020/06/30/graph-computation/#graphs-inductively>

I wonder if something like this could be applied to MST processing and visualization. I've included very simple tree reduction already (automatic substitution of numeric expressions). But I am not sure where it could go next.

You might have a chat with <@UCWGNUKJ6>, I think he is working on some related topics:

<https://github.com/vorpal-research/SymKt/blob/master/src/main/kotlin/ru/spbstu/Symbolics.kt>

<https://github.com/vorpal-research/LogicKt>

Another approach you could try is using Z3's `simplify`: <https://github.com/tudo-aqua/z3-turnkey>

<https://ericpony.github.io/z3py-tutorial/guide-examples.htm>

I've also been playing around with this project called symja, which has a pretty sophisticated rewrite/reduction system based on abstract algebra, it also supports expression simplification: <https://github.com/axkr/symja_android_library/blob/77686fff4e41b7864af0aa7cbf45ae0cdf759a03/symja_android_library/doc/functions/Simplify.md>

I think symja uses JAS behind the scenes, this project implements some nice algorithms for e.g. polynomial reduction:

<https://www.researchgate.net/profile/Heinz_Kredel/publication/221588647_Algebraic_Structures_as_Typed_Objects/links/00b495258254139fee000000.pdf>

<http://krum.rz.uni-mannheim.de/jas/>

Interesting. I think for now we will focus on computation contexts and evaluating those symbolic expressions effectively, but if someone wants to do fuly symbolic computations it is quite easy to implement on top.