摘要: In this paper we study the compilation of Prolog by making visible hidden operations (especially unification), and then optimizing them using well-known partial evaluation techniques. Inspection straight forward partially evaluated unification algorithms gives an idea how to design special abstract machine instructions which later form target language our compilation. We handle typical compiler problems like representation terms explicitely. This work a logical reconstruction code, represents approach constructing correct from such code. As example, are explaining principles Warren's New Engine within framework.