"Vesa Karvonen" <[EMAIL PROTECTED]> writes:
> Vesa Karvonen:
> I have now implemented a subset of the language I described in my
> previous post. It turns out that my extrapolation is not completely
> bogus.
Great!
> It is definitely possible to get reasonable performance from
> the interprete
Mr. Karvonen,
I was just wondering if or when you were planning on posting the code
for this PP-evaluator for your extended lambda calculus?
I look forward to tinkering around with it if u do ;-)
regards,
-Faisal Vali
___
Unsubscribe & other ch
wow - this is really kool stuff -
We implemented a by-value evaluator for this language using haskell, but
to implement a beta-reducer using the cpp preprocessor is extremely kool
-
For those of you who want an excellent introduction to lambda calculus
(and specifically the language implemented b
Vesa Karvonen:
David Abrahams:
Vesa Karvonen:
The estimate that a nearly optimal interpreter might be just 2x-10x
slower than the language in which the interpreter is implemented is
based on the simple observation that such numbers hold for modern
interpreters.
Heh, I'm having trouble with that ext
