Skip to main content
4 votes

Is bytecode ("virtual machine code") inherently faster to compile and/or interpret, than higher level (above Assembly) languages?

does the bytecode map to the machine instructions of the underlying processor more easily than some higher level language? That depends entirely on the bytecode, the higher level language, and the ...
Jörg W Mittag's user avatar
3 votes
Accepted

Closures break induction in correctness proof of interpreter

You must strengthen the theorem to be proved by induction. In the $e_1e_2$ case, the current induction hypothesis just tells you that $e_1$ reduces to a closure, but not anything more about how the ...
Li-yao Xia's user avatar
3 votes
Accepted

Intermediate Representation vs Byte Code

This is from just the summary of the article, and I'm not sure that it is a terribly helpful one. What I think the author was trying to say is that the difference between 2 and 3 is who translates the ...
Pseudonym's user avatar
  • 22.3k
2 votes

Is a language *engine* the same as a language *implementation*?

I've never heard of the phrase "language engine" before, so I don't think you need to worry about knowing that phrase. Perhaps it is used in certain communities, such as browsers. From ...
D.W.'s user avatar
  • 162k

Only top scored, non community-wiki answers of a minimum length are eligible