A Determinacy Testing Algorithm for Nondeterminate Flat Concurrent Logic Programming Languages

39 pagesThis paper describes an algorithm for the code generation of determinacy testing for nondeterminate flat concurrent logic programming languages. Languages such as Andorra and Pandora require that procedure invocations suspend if there is more than one candidate clause potentially satisfying the goal. The algorithm described has been developed specifically for a variant of flat Pandora based on FGHC, although the concepts are general. We have extended Kliger and Shapiro's decision-graph construction algorithm to compile "don't know" procedures which must suspend for nondeterminate goal invocation. The determinacy test is compiled into a decision graph quite different from those of committed-choice procedures, but we argue that in most cases, the same low space complexity is retained

Continuation Compilation for Concurrent Logic Programming

A new and powerful approach to threading is proposed, that is designed to improve the responsiveness of concurrent logic programs for distributed, real-time AI applications. The technique builds on previously proposed scheduling techniques to improve responsiveness by synchronously passing control and data directly from a producer to a consumer. Furthermore, synchronous transfer of data requires less buffering and so less garbage is produced. Arguments are also passed in registers, further reducing overheads

Synthese en chemie van 4-azahomoadamantan-5-on.

This thesis deals with the synthesis of 4 -azatricyclo- 4.3.1.1 3,8]undecan-5-one (4-azahomoadamantan-5-one) and derivatives thereof. Moreover a new and convenient synthesis of 4-hydroxyadamantan-2-one is described. After an introductory chapter, a review of the literature on variations of the adamantane skeleton and on the pharmacological and anti-viral properties of adamantane derivatives is given in chapter two...