murisitarusenga

5 ms·

1. 1.▲
   by murisitarusenga 8y ago

   Thanks. No, no further plans at the moment. I just wanted to see what a program in L2 might look like.
2. 2.▲
   by murisitarusenga 8y ago

   I designed a programming language, L2, a while ago by stripping C down to a minimal core and adding Lisp-style procedural macros to it. In addition to the original bootstrapping compiler written in C, I've now built a self-hosting comp
3. 3.▲
   Show HN: L2 – An untyped, unsafe, and unhygienic programming language(github.com)

   6 points by murisitarusenga 8y ago|3 comments
4. 4.▲
   by murisitarusenga 8y ago

   What is linked is an experiment where I construct programs according to certain rules. While I do not list what these rules are, imagine the sort of rules that constrain one when making a mathematical proof.
5. 5.▲
   Show HN: Strictured Programming [pdf](github.com)

   1 points by murisitarusenga 8y ago|1 comments
6. 6.▲
   by murisitarusenga 9y ago

   Thanks.
7. 7.▲
   by murisitarusenga 9y ago

   My conjecture is that through studying the linked algorithms (as you would a math proof), one can learn a decent amount of linear algebra.
8. 8.▲
   Show HN: A Rigorous Proofless Approach to Linear Algebra [pdf](github.com)

   14 points by murisitarusenga 9y ago|3 comments
9. 9.▲
   by murisitarusenga 9y ago

   Though you jest, Forth did influence certain decisions in L2's design. In particular, by using continuations you can make an L2 function temporarily leave a variable amount of data at the top of the stack in order for the caller or som
10. 10.▲
    by murisitarusenga 9y ago

    I will try to read into the details of Scheme's implementation of continuations... The reason I made the claim about efficiency is because Scheme's continuations have an unlimited lifetime. This is in contrast to L2's continu
11. 11.▲
    by murisitarusenga 9y ago

    Thanks for the link. I am not sure if I see the similarity. L2 neither uses the heap nor garbage collection nor are its programs converted into continuation-passing-style. Am I missing something?
12. 12.▲
    by murisitarusenga 9y ago

    Thank you. I personally struggled to understand Scheme continuations from their English descriptions, so I made a point of including concrete implementation details in my write-up. Thank you for the link to PreScheme. It seems to have exact
13. 13.▲
    by murisitarusenga 9y ago

    I'm not sure if this is correct. Googling fexprs takes me to this Lambda the Ultimate post: http://lambda-the-ultimate.org/node/3640#comment-51665 . There it says that fexprs map from s-expressions (of the operands
14. 14.▲
    by murisitarusenga 9y ago

    I'm not sure of the exact definition of a runtime... The best I can say is that the instructions emitted by the compiler correspond directly to the commands in the source file. You are certainly correct about the Lispyness. I've n
15. 15.▲
    by murisitarusenga 9y ago

    L2 is an experimental programming language that maps efficiently to machine code (like C). I think it is interesting because I have not seen 1) control flow primitives that are like Scheme's continuations but that are also efficient 2)
16. 16.▲
    Show HN: L2: An elegant untyped, unsafe, unhygienic programming language(github.com)

    83 points by murisitarusenga 9y ago|22 comments
17. 17.▲
    Show HN: L2: An experiment/programming language(github.com)

    2 points by murisitarusenga 9y ago|0 comments