Note that Core is an explicitly typed language, which can make it quite difficult to generate from other languages (the GHC type checker has inferred all the types so it's no problem there). For example, the usual identity function (id = \x -> x :: forall a. a -> a)
becomes
id = \(a :: *) (x :: a) -> a
where a
is a type variable of kind *
. It is a term-level place-holder for the type-level forall
binding. Similarly, when calling id
you need to give it a type as its first argument, so the Haskell expression (id 42)
gets translated into (id Int 42)
. Such type bindings and type applications won't be present in the generated machine code, but they are useful to verify compiler transformations are correct.
On the bright side, it might be possible to just generate Haskell -- if you can generate the code in such a way that GHC will always be able to determine its type then you are essentially just using a tiny subset of Haskell. Whether this can work depends very much on your source language, though.