Kernel Andorra Prolog is a framework for nondeterministic concurrent constraint logic programming languages. Many languages, such as Prolog, GHC, Parlog, and Atomic Herbrand, can be seen as instances of this framework, by adding specific constraint systems and constraint operations, and optionally by imposing further restrictions on the language and the control of the computation model. We systematically revisit the description in Haridi and Jarison [HJ90], adding the formal machinery which is necessary in order to completely formalize the control of the computation model. To this we add a formal description of the transformational semantics of Kernel Andorra Prolog. The semantics of Kernel Andorra Prolog is a set of or-trees which also captures infinite computations.

Additional Metadata
Persistent URL dx.doi.org/10.1007/3-540-54152-7_68
Conference International Conference on Parallel Architectures and Languages Europe - PARLE
Citation
Haridi, S, & Palamidessi, C. (1991). Structural operational semantics for Kernel Andorra Prolog. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 238–253). doi:10.1007/3-540-54152-7_68