search for: 3e0148d8

Hi Valery On 13 September 2010 19:07, Valery Khamenya <khamenya at gmail.com> wrote: > are there any attempts to use LLVM in graph-rewriting (term-rewriting) > language implementations? I've added a new LLVM backend to the ghc Haskell compiler. > How good is LLVM for this? Works very well. I'm operating from the low levels of the ghc compiler though where I don't

Hi, are there any attempts to use LLVM in graph-rewriting (term-rewriting) language implementations? How good is LLVM for this? E.g., is it natural to expect that the LLVM-based implementation of the language Concurrent Clean be any faster than its reference implementation? Best regards -- Valery A.Khamenya -------------- next part -------------- An HTML attachment was scrubbed... URL: