@ljs@liskin it's certainly debatable, but it does simplify life in the sense that people don't have to worry about cleaning up their commits, which in my experience can get tedious.
I agree, having all the relevant information in commit messages would be ideal. But what do you do when your project already has its established workflows?
So, und hier ist jetzt auch mein aktueller Artikel, für den ich uneingeladen und teils unbemerkt interne Webex-Meetings der SPD besucht habe. Keine Frage, die Partei hätte sich um die Sicherheit ihrer Videokonferenzlösung kümmern müssen und unsichere Default-Einstellungen ändern. Aber dass Cisco nach unserem Artikel über die Bundeswehr nicht wenigstens seine anderen Kunden der "sicheren Behördenlösung" gewarnt hat, finde ich noch krasser. https://www.zeit.de/digital/datenschutz/2024-05/spd-sicherheitsluecke-it-cybersicherheit #Cybersecurity#webex
how the hell do you add dependencies in Haskell stack, I add yesod to the build-depends in the cabal file like shown in the stack example but on running stack build it fails saying it couldn't find yesod, and then the line is removed from the cabal file. Haskell ecosystem is hell.
The max_id, since_id, and min_id parameters in #Mastodon's Timeline API assume that the post ID is a sortable number. (Is this correct?) #Hollo, the #ActivityPub implementation I'm building, uses UUIDs for post IDs internally, so I'm stuck on how to implement a Mastodon-compatible API.
" “Jim was an exceptional leader who did transformative work in mathematics and developed a world-leading investment company,” says Simons Foundation president David Spergel. “Together with Marilyn Simons, the current Simons Foundation board chair, Jim created an organization that has already had enormous impact in mathematics, basic science and our understanding of autism. The Simons Foundation, an in-perpetuity foundation, will carry their vision for philanthropy into the future.” "
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.
I think I’m ready for my talk at our two-day proof theory workshop, starting tomorrow: https://consequently.org/presentation/2024/lambda-mu-arche/ — I have a lot to pack in to 25 minutes, so the monster-sized handout contains some of the details I’ll skim over in the talk.
