Clojurians Log v2

Just a note about this, I'm not particularly great a presenting/time management during a presentation and didn't cover as much as I would have liked to. For people who already know about the library, there's nothing new here. For people new to the library, I think the docs are probably going to be the most effective way to learn Meander.

I loved it actually! 🙂 Docs are great but I think there is something to be said for seeing someone skilfully use a tool, small mistakes, detours and all — it more closely resembles the actual usage context — gives one ideas and confidence to try them out 💪 So thank you!

Question: are the Clojure ML folks largely on Zulip?

I took a peek at tech.ml.* on Friday and I want to learn more.

(Currently learning pytorch and working through the fastai book.)

> largely on Zulip? yes

a few useful chat streams: https://scicloj.github.io/docs/community/chat/

> I loved it actually! 🙂 > Docs are great but I think there is something to be said for seeing someone skilfully use a tool, small mistakes, detours and all — it more closely resembles the actual usage context — gives one ideas and confidence to try them out 💪 > So thank you! I felt the same. To me, this seems the best path for learning such a topic, and also the best path to prepare for more advanced topics. For live coding to be clear & didactic, it needs to be slow enough. It actually made sense to spend that time with Meader basics, in my opinion.

I use it at work for some tasks and specter for others. I was able to grasp specter a bit better (although I used meander first). They are both missing aggregations.

> They are both missing aggregations. @lidorcg Aggregations exist on the zeta branch and to a degree are also available on the epsilon branch as memory variables. An "aggregation" on the zeta branch is actually just custom variable type which is simply a pair of rewrite systems (functions). The first function takes, as an argument, the current state of the variable and a value to be stored, and computes the new value of the store AKA fold. The second function task, as an argument, the current state variable and computes a pair of the value to return from the store and the next value of the store AKA unfold.

;; Store a value
[current-state incoming-value] -> next-state
;; Dispense a value
current-state -> [outgoing-value next-state]

The only thing this description lacks is an account of failure, both in the fold and in the unfold. Fortunately, zeta does account for this and the definition of variables/aggregators can specify a how storage/retrieval can fail. For example, we can say that if a variable has never stored anything it is unbound. Retrieving an unbound variable could mean failure (in most programming settings this would result in a compile time/runtime error).

4: ... yet, but plan to

@noprompt thanks for addressing that, on the last task the required group by and aggregation I posted a question here and after a little search on the channel I found an answer that basically said "we're working on it" so I rooted for you and solved it in the old clojury way 😁 . Next data manipulation task I have I'll come back to meander and will give it another go 💪🏼. I always seek different tools that give different perspectives on problems, and meander sure is different so I'll keep on checking on it