Home/ Questions/Q 6042721
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-23T06:49:17+00:00

So I now have a fairly complete LISP (scheme) interpreter written in haskell. Just

  • 0

So I now have a fairly complete LISP (scheme) interpreter written in haskell. Just for fun I want to try to have it compile down to LLVM. Most of the code generation seems pretty straight forward, but I’m at a loss as to how to generate code for a lambda expression (kind of important in lisp 😉 ) and how to manage the heap when I encounter a define expression.

How might I generated code for these expressions?

Note: I can generate code for the body of the lambda expression, What is confusing me is how to “put” that code somewhere and make it callable.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    See Lennart’s blog post: http://augustss.blogspot.com/2009/06/more-llvm-recently-someone-asked-me-on.html

    Look at the compileFunction function. In particular, newFunction in the LLVM core: http://hackage.haskell.org/packages/archive/llvm/0.9.1.2/doc/html/LLVM-Core.html#g:23

    • 0