woodrush

5 ms·

1. 1.▲
   by woodrush 4y ago

   I actually mentioned your hint file in details.md. Quite a roundabout way to decode its secrets! I too suspect that writing in lambda's native functional style could save a lot of space. Compiling lisp.c from the ELVM repository genera
2. 2.▲
   Show HN: Lambda-8cc – An x86 C compiler written in untyped lambda calculus(github.com)

   249 points by woodrush 4y ago|29 comments
3. 3.▲
   by woodrush 4y ago

   Thank you for taking a look, and many thanks for your constructive comments. I found the BLC language and interpreter to be elegant and that was what brought me here. I was unaware of the nil-test-free method for Scott-encoded lists. It&#x2
4. 4.▲
   by woodrush 4y ago

   The basic tools required for implementing a LC interpreter in LC is demonstrated in LambdaLisp. Although LambdaLisp implements Lisp, the same tools can be used to implement a LC interpreter in LC. The largest concern in question here may be
5. 5.▲
   by woodrush 4y ago

   Thanks for your feedback, I forgot to mention the execution speed in the post. The number guessing game example (44 lines long) in the Usage section actually runs with an instantaneous response time on the terminal. I added some remarks on
6. 6.▲
   Show HN: LambdaLisp – A Lisp interpreter that runs on lambda calculus(woodrush.github.io)

   189 points by woodrush 4y ago|100 comments
7. 7.▲
   by woodrush 5y ago

   Thank you for your compliment! It is very encouraging and I appreciate it. I was excited too when I actually got the neural network running on the emulator.
8. 8.▲
   Show HN: Building a Neural Network in Pure Lisp Without Built-In Numbers(woodrush.github.io)

   33 points by woodrush 5y ago|2 comments
9. 9.▲
   by woodrush 5y ago

   Author here. Thank you! I had a lot of fun as well working on this project. I appreciate you and everyone's compliments since it encourages me a lot for working hard on my projects and sharing them.
10. 10.▲
    Show HN: Extending SectorLISP to Implement Basic REPLs and Games(woodrush.github.io)

    43 points by woodrush 5y ago|4 comments
11. 11.▲
    by woodrush 5y ago

    Thanks! That would be since the skippable timestep width is bounded by the size of the size of the patterns that you've memorized. Say we have a square pattern of size W. The outcome of this pattern within this region in 1 timestep is
12. 12.▲
    by woodrush 5y ago

    Hi, I'm the author of this project. HashLife actually does just that, by memoizing and reusing past occurrences and outcomes of the same pattern. Since one cell can only interact with its 8 neighbors in one timestep, there is a limit t