🚀 go-pugleaf

Hi All,

I am looking into development of "Haskell virtual machine". Current
Haskell implementtaions usually compile Haskell source into some code
in C (containing description of the graph to reduce), and then it is
passed through a regular C compiler, combined with runtime and then a
pretty big executable is produced. What I am looking into: to strip
the runtime into a shared chunk of code (like Java virtual machine is
the same executable for every Java program), and store the pieces of
graph (functions) as something like loadable Java classes (binary
files also shared between different programs) with possibility of
loading on demand (so these files might be primary output from the
compiler). I haven't looked into details of each Haskell runtime
implementation; maybe there exist some papers decribing their
internals. I also hope that developers of Haskell implementations read
these newsgroups, so maybe some of them might suggest better ways of
conversion of their existing runtime into a virtual machine (or
totally discourage me from doing that).

What might be helpful: information how to understand the structure of
the C code generated to describe a graph.

I tried to search Google for "Haskell virtual machine", but results
were mostly related to bridging of Java VM and Haskell what is not I
am looking for.
Has anyone tried to do such a conversion? Maybe such a project already
exists?
I will appreciate any input.
PS If you want to contact me via e-mail please write to dimitry at
golubovsky dot org: the address found in this message's header is
indeed a spam trap.