Rotating Hexapod
@zorodendron.bsky.social
programming languages / formal logic
headed to san francisco next year: dates tbd, but i’ll be around for a while. if you’re in the area and want to hang out , let me know.
December 5, 2024 at 6:17 AM
headed to san francisco next year: dates tbd, but i’ll be around for a while. if you’re in the area and want to hang out , let me know.
category theory is wild because it starts with arrows go brr and ends with everything is connected in the most beautiful way possible
November 18, 2024 at 12:43 PM
category theory is wild because it starts with arrows go brr and ends with everything is connected in the most beautiful way possible
learning a little category theory as a treat
November 5, 2024 at 11:03 PM
learning a little category theory as a treat
Bluesky now has over 10 million users, and I was #4,912,703!
September 18, 2024 at 4:55 PM
Bluesky now has over 10 million users, and I was #4,912,703!
“However, Rust (like most high-level languages) does not provide direct control over instruction prefetching because instruction caching is managed at the hardware level.”
High-level 🤔
High-level 🤔
September 4, 2024 at 10:03 AM
“However, Rust (like most high-level languages) does not provide direct control over instruction prefetching because instruction caching is managed at the hardware level.”
High-level 🤔
High-level 🤔
Do any of you know any research or papers on relevance logics and type systems?
The Curry-Howard isomorphism suggests the existence of a type system corresponding to relevance logic.
I’ve struggled to find any literature on relevance type systems. There’s just one (1) Wikipedia paragraph!
The Curry-Howard isomorphism suggests the existence of a type system corresponding to relevance logic.
I’ve struggled to find any literature on relevance type systems. There’s just one (1) Wikipedia paragraph!
August 12, 2024 at 10:41 PM
Do any of you know any research or papers on relevance logics and type systems?
The Curry-Howard isomorphism suggests the existence of a type system corresponding to relevance logic.
I’ve struggled to find any literature on relevance type systems. There’s just one (1) Wikipedia paragraph!
The Curry-Howard isomorphism suggests the existence of a type system corresponding to relevance logic.
I’ve struggled to find any literature on relevance type systems. There’s just one (1) Wikipedia paragraph!
@mattparlmer.bsky.social congratulations on the i-400-a launch!
August 8, 2024 at 6:09 PM
@mattparlmer.bsky.social congratulations on the i-400-a launch!
Rimworld storage files are unreadable, hindering my project and preventing the use of SMT solvers for Rimworld logistics issues.
August 3, 2024 at 10:24 AM
Rimworld storage files are unreadable, hindering my project and preventing the use of SMT solvers for Rimworld logistics issues.
SMT solvers can solve pathfinding problems
July 26, 2024 at 2:47 AM
SMT solvers can solve pathfinding problems
Z3 and analytic tableaux essentially do the same thing in my project.
July 19, 2024 at 2:14 PM
Z3 and analytic tableaux essentially do the same thing in my project.
New project beginneth.
This one will contain observability and logging tools for Z3 and Z3Py.
github.com/zorodendron/...
This one will contain observability and logging tools for Z3 and Z3Py.
github.com/zorodendron/...
zorodendron - Overview
zorodendron has 3 repositories available. Follow their code on GitHub.
github.com
July 18, 2024 at 7:49 PM
New project beginneth.
This one will contain observability and logging tools for Z3 and Z3Py.
github.com/zorodendron/...
This one will contain observability and logging tools for Z3 and Z3Py.
github.com/zorodendron/...
new type-checking algorithm using a depth vector
July 16, 2024 at 9:38 AM
new type-checking algorithm using a depth vector
Last November, I built a parser for a cheminformatics file format. I'm planning to refactor it and post it soon. Anyone interested?
July 16, 2024 at 5:17 AM
Last November, I built a parser for a cheminformatics file format. I'm planning to refactor it and post it soon. Anyone interested?
You can capture Z3 inferred clauses from Z3Py using a callback.
July 13, 2024 at 5:14 PM
You can capture Z3 inferred clauses from Z3Py using a callback.
alarm clock with computer that loads you into CS:GO match
July 13, 2024 at 10:07 AM
alarm clock with computer that loads you into CS:GO match
Making progress on the formal logic DSL and its tooling, despite feeling wretched today.
July 9, 2024 at 1:36 PM
Making progress on the formal logic DSL and its tooling, despite feeling wretched today.
It feels like I can't breathe. As if something is lodged in my throat and lungs.
July 9, 2024 at 10:18 AM
It feels like I can't breathe. As if something is lodged in my throat and lungs.
Halfway through implementing a truth table for propositional logic. I had read that truth tables are isomorphic to Boolean algebras and finite topologies. It's possible to compile the tables to those.
July 7, 2024 at 8:53 AM
Halfway through implementing a truth table for propositional logic. I had read that truth tables are isomorphic to Boolean algebras and finite topologies. It's possible to compile the tables to those.
I found a memory efficient and cache-friendly way to represent chemistry elements.
July 5, 2024 at 5:21 AM
I found a memory efficient and cache-friendly way to represent chemistry elements.
Commits to GitHub today.
July 4, 2024 at 10:56 PM
Commits to GitHub today.
I accidentally deleted code for the depth vector proposition representation. I‘m restoring it now using generic functions over proposition types.
July 4, 2024 at 12:13 AM
I accidentally deleted code for the depth vector proposition representation. I‘m restoring it now using generic functions over proposition types.
I can’t sleep, and I’m hungry so my mood is bad. but I’ve discovered a way to connect segment tree algorithms, depth vectors, and abstract syntax trees.
You can search for AST nodes in O(log n) time instead of O(n). This is valuable for large programs with many nodes or processing multiple ASTs.
You can search for AST nodes in O(log n) time instead of O(n). This is valuable for large programs with many nodes or processing multiple ASTs.
June 27, 2024 at 1:40 AM
I can’t sleep, and I’m hungry so my mood is bad. but I’ve discovered a way to connect segment tree algorithms, depth vectors, and abstract syntax trees.
You can search for AST nodes in O(log n) time instead of O(n). This is valuable for large programs with many nodes or processing multiple ASTs.
You can search for AST nodes in O(log n) time instead of O(n). This is valuable for large programs with many nodes or processing multiple ASTs.
OATD – Open Access Theses and Dissertations
oatd.org
June 26, 2024 at 9:25 PM