Variable elimination for building interpreters

Details Variable elimination for building interpreters Variable elimination for building interpreters

2010-05-10

arxiv.org/abs/1005.1466v1

Computer Science

Software Engineering

33 pages

Scientific paper

In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (the language which is used to build the interpreter). In order to transform user-defined functions into host language functions we use combinatory logic : lambda-abstractions are transformed into a composition of combinators. We provide a mechanically checked proof that this step is correct for the call-by-value strategy with imperative features.

Affiliated with

Also associated with

No associations

Rating

Variable elimination for building interpreters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Variable elimination for building interpreters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Variable elimination for building interpreters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627237