I remember recently reading a new paper elaborating a novel presentation of graph algebras. But I can't for the life of me remember the title or the author.
The central idea was axiomatizing vertices as pairs of sets of all incoming and outgoing edges.
It also had example code in Haskell.
Does anybody have an idea of the title? I'd be very thankful for suggestions.
Dass die Russen dieses Gespräch abhören konnten wäre ein ernstes Problem, auch ohne die Veröffentlichtlichung, und muss wohl eine Verbesserung der Informationssicherheit zur Folge haben.
Dass die Luftwaffenführung sich Gedanken macht über den Einsatz der #Taurus, ist gut und richtig, und völlig legitim.
Dass es jetzt so viel Aufregung um diese Geschichte gibt ist schon ein Gewinn für Russland.
Warum konnte sich die @Bundesregierung nicht darauf zurückziehen, dass man so etwas nicht kommentiere, und die etwaige Echtheit der Aufnahme nicht öffentlich zu bewerten?
This is your friendly reminder that I make and sell delightful miniature retrocomputers like TRS-80s, Osborne Ones, and the occasional big friends like Connection Machines and Crays.
I'm a retired nerd who's living the dream. Well, if your dream is working in your garage on tiny art machines. 😺 ⚙️ #retrocomputing#miniatures#trs80#cray#shamelessSelfPromotion https://store.transmutable.com/
CLC seeks nominations for a vacant seat. Who should apply? Anyone who meets the following criteria should apply: Candidates should have enough bandwidth to review merge requests to base on a semi-frequent basis (3 to 5 per month), and sustain this for their 3 years term in a healthy manner. Candidates should be able to...
I feel like I shouldn't be this proud of it, but I just wrote a recursive descent parser from scratch in one go in C and debugged a small problem (off by one error of course) using gdb; all in under half an hour.
reminds me that when recently learning about semantics of programming languages, no body seems to ever talk about program execution explicitly. at least not for functional languages.
CLC Election September 2023 (discourse.haskell.org)
CLC seeks nominations for a vacant seat. Who should apply? Anyone who meets the following criteria should apply: Candidates should have enough bandwidth to review merge requests to base on a semi-frequent basis (3 to 5 per month), and sustain this for their 3 years term in a healthy manner. Candidates should be able to...