DoubleDecoded

4 ms·

1. 1.▲
   by DoubleDecoded 2mo ago

   1D languages encode these relations grammatically. There is no reason why a 2D language couldn't also be grammatical. Sure it is harder to write a 2D parser perhaps, but people have still played with the idea a little bit. There is jus
2. 2.▲
   LM/LSTS inference-injected garbage collection programming language(medium.com)

   1 points by DoubleDecoded 4mo ago|0 comments
3. 3.▲
   by DoubleDecoded 2y ago

   Thanks for showing Register state and flags. Is this all instructions?
4. 4.▲
   by DoubleDecoded 2y ago

   "could break the guarantees" is a weak guarantee then.
5. 5.▲
   Most Opcodes Are Typesafe If Memory Is Infinite(andrewjohnson4.substack.com)

   2 points by DoubleDecoded 2y ago|0 comments
6. 6.▲
   by DoubleDecoded 2y ago

   https://github.com/andrew-johnson-4/lambda-mountain Working on verifiable correctness for programs written in LM or anything that generates annotated assembly. Basically low-level proofs that accessed memory is valid a
7. 7.▲
   Show HN: A Tiny Compiler for a Tiny Functional Language(github.com)

   8 points by DoubleDecoded 2y ago|0 comments