Viewing profile — olydis

A good point! From the “visual introduction” post mentioned elsewhere: Rules 1 and 2 seem arbitrary […], but behave analogous to the K and S operators of combinatory logic, which i…

Thanks! For now, I added a link to your website to https://treecalcul.us/specification/ just now.

Ooops, thanks for catching, typo fixed. That Tree Calculus is intenSional ( https://plato.stanford.edu/entries/logic-intensional/ ) is one of its main selling points, so that spell…

Correct. I think of it this way: The reduction rules prescribe an encoding for functions, but don't describe it for other (traditional) data. But there are very canonical choices o…

Super cool, thanks for the pointer! I'll note, though, that one of the main value adds of (this) TC is that it is also intensional . See website for some elaboration and examples, …

Correct! The huge value add of TC is that it is also intensional , which SKI or LC are not. This is a property one is not commonly confronted with (which is a shame), but means tha…

Thanks for the feedback! Tree Calculus is a calculus/logic, see Specification page or the book by Barry Jay (linked on that page) for way way better and detailed verbose explanatio…

Super cool! I think a (potentially animated) version of this would be an excellent addition for the website's "Specification" page :)

Note that it refers to his book on the "Specification" page :) > Seems to be a pattern for them sadly, not sure why Can you elaborate? Agreed I could (and will) attribute more expl…

Thanks for the feedback! The target audience I had in mind was certainly developers (like me), not "all people". And the wording was indeed inspired by PL talks and blog posts I co…

Hi all, author of the website here (I'm https://johannes-bader.com/ ). Wow, thanks for the reactions and many good suggestions! I thought I'd add a bit of context here. As has corr…