search for: 9465d058

Valery Khamenya wrote: > are there any attempts to use LLVM in graph-rewriting (term-rewriting) > language implementations? Pure is a dynamically typed FPL based on term rewriting: http://pure-lang.googlecode.com/ It uses the LLVM JIT to compile and execute code on the fly in an interpreter-like environment, and can also batch-compile code to native executables. This includes the

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: