Interprétation par syntaxe abstraite d'ordre supérieur et traduction en combinateurs

We present a program interpretation technique relying on an higher order abstract syntax which allows the reuse of the mechanisms of the host language (used to implement the interpreter) dedicated to application reductions instead of reimplementing them. This approach constitutes a simple and reasonably efficient alternate solution for fast interpreter development. This interpretation schema requires that the functions defined through the interpreted language be translated on the fly into functions of the host language. We use combinatory logic to make that translation in order not to limit our approach to the use of languages allowing meta programming