Kernel Andorra Prolog and its computation model
Seif Haridi, Sverker Janson · 1990
The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints. The languages Prolog, GHC, Parlog, and Atomic Herbrand, are all executable in the Kernel Andorra Prolog computation model. There are instances of the framework in which all of these languages are embeddable. 1 1 INTRODUCTION For some time now, the main efforts of logic programming language-design and implementation have been aimed towards either optimizations of Prolog, and AND/OR parallelizations thereof, or (more or less flat) concurrent committed choice languages. Preliminary research has shown that general combinations of these language types introduce new difficulties, affecting both language design and implementation. Nevertheless, research in these two subareas is maturing, and the time h...