Hey There Buddo!
522 FOLLOWERS
Follow to get updates on programming from this blog to your inbox.
Hey There Buddo!
3d ago
Knuckledragger is the moniker I’ve given to an approach and library I’m developing to do interactive theorem proving in python with the heavy lifting done by pre existing automated solvers ..read more
Hey There Buddo!
3d ago
There are lots of interesting little subproblems in compilation like instruction selection, register allocation and instruction scheduling. These can be expressed in declarative interlinked way to constraint solvers ..read more
Hey There Buddo!
3d ago
An interesting category of solver that is not discussed much is that of termination checkers ..read more
Hey There Buddo!
3d ago
I’ve been working on writing intra-function binary patches using high level C code for a few years. If it could be made easy and correct, it could unlock superpowers ..read more
Hey There Buddo!
3d ago
Something that is an open problem in the egraph community is how to cleanly integrate domain specific information / normalizing rewrite systems / algorithms cleanly with egraph rewriting. AC, lambda, graphs, cheap arithmetical reasoning are all quite desirable ..read more
Hey There Buddo!
3d ago
I’ve been reading about ACL2, a theorem prover designed for common lisp. It has good automation and has been quite successfully applied to significant software/hardware verification and mathematics ..read more
Hey There Buddo!
3d ago
I bought a cute little 4 bit cpu kit from Aliexpress called the TD4. It has 2 registers, some LEDs, and 16 bytes of program ROM. Quite limited but still very cool and teaches a lot of principles of computer architecture ..read more
Hey There Buddo!
2M ago
One of the interesting things about Datalog is that it has a fairly simple notion of proof or provenance. What you want to know is how a row ended up in your database. Which rule fired and what extra variables were matched on? Souffle supports this feature https://souffle-lang.github.io/provenance. You can use this info for datalog as a theorem prover, or to enable incrementality or debuggability, or for rule selection synthesis.
I really conceptually love that the canonical Datalog program is the edge-path transitivity query and the simple obvious notion of “proof object” for connectivity in ..read more