Link Details

Link 998413 thumbnail
User 448255 avatar

By dotCore
via playingwithpointers.com
Submitted: Jul 16 2013 / 02:10

I've been toying with the idea of writing a compiler for the untyped lambda calculus [1] for a while; and now that I'm on vacation, I finally managed to refactor out some time to spend on it. The first iteration, echoes [2], generates horrible, but runnable code. It reads λ expressions (via a lispy syntax) and compiles them to plain ol' x86-64 assembly, runnable pending getting linked into the runtime. It understands a tiny bit more than pure lambda calculus — echoes has native support for booleans, integers and if statements. The compiled code obeys lazy call-by-name [3] semantics.
  • 1
  • 0
  • 63
  • 34

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Upvoters (1)



Downvoters (0)



    Apache Hadoop
    Written by: Piotr Krewski
    Featured Refcardz: Top Refcardz:
    1. Play
    2. Akka
    3. Design Patterns
    4. OO JS
    5. Cont. Delivery
    1. Play
    2. Java Performance
    3. Akka
    4. REST
    5. Java