Is it possible to write meta-circular evaluator without mutable data structures?
Name:
Anonymous2013-03-23 15:32
>>1
Lambda Calculus is both Turing Complete and immutable. But writing a Haskell interpreter is a challenge in itself. Haskell is already 23 years old, but GHC is far from being production ready.