CAMEL: An extension of the categorical abstract machine to compile functional/logic programs

Abstract

In this paper we present a clean implementation technique for functional/logic (or algebraic) programming languages. First we define an intermediate language to which a functional/logic program is compiled. In order to implement this intermediate language, we extend the Categorical Abstract Machine (CAM) by an additional data structure to handle logical variables and by a few instructions covering unification and backtracking. Finally, we show how the intermediate language is compiled into the instruction set of our Categorical Abstract Machine extension.