---IDEA---
I was wondering if we could have a bytecode DSL that would map directly to
JVM assembler, using either Jasmin <http://jasmin.sourceforge.net/> or
Krakatau <https://github.com/Storyyeller/Krakatau>.
Then we could define primitives using these bytecode instructions.
For eg:
(defroutine + [a b]
(push! a)
(push! b)
add!
pop!)
that could be used to call:
(+ 2 3) ;=> 5
------
We could define the lambda calculus primitives in the same way.
This would be awesome because bottlenecks could be optimized by embedding
assembly inside Lisp itself.
We could do efficient bit-manipulation, write shader routines, and what not.
------
Thoughts?
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderated - please be patient with your
first post.
To unsubscribe from this group, send email to
clojure+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/clojure?hl=en
---
You received this message because you are subscribed to the Google Groups
"Clojure" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to clojure+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
