3 citations found. Retrieving documents...
T. Chikayama, T. Fujise, and D. Sekita, "A Portable and Efficient Implementation of KL1", Proc. Int. Symp. on Programming Language Implementation and Logic Programming, Sept. 1994, pp. 25--39

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Detection And Optimization Of Suspension-Free Logic Programs - Debray, Gudeman, Bigot (1996)   (12 citations)  (Correct)

.... policy in jc is to schedule awakened goals after all previously ready goals have finished executing (the more common schedule awakened goals immediately behavior can be obtained via a compiler option) KL1 provides a system of priorities that must be respected when awakened goals are executed [5]. To this end, we assume that there is a third system dependent function insert : Atom Theta Atom Gamma Atom such that, given a sequence of ready goals G and a sequence of awakened goals G 0 , insert(G; G 0 ) is the sequence of goals obtained by inserting the awakened goals G ....

....a very small part of the overall 14 compilation time. Because Janus programs are compiled to C code which is then processed by a C compiler, most of the overall time for translation to the object code is spent in I O operations and in the C compiler (other systems that compile to C, e.g. KLIC [5], report similar experiences) As a result, there is no perceptible decrease in the overall compile time when dataflow analysis and optimizations are switched off. 5.2. Precision Since our analysis is not tied to any particular abstract domain, the question of precision is, in some sense, moot: ....

[Article contains additional citation context not shown here]

T. Chikayama, T. Fujise, and D. Sekita, "A Portable and Efficient Implementation of KL1", Proc. Int. Symp. on Programming Language Implementation and Logic Programming, Sept. 1994, pp. 25--39


A comparison of some schemes for translating logic to C. - Demoen, Maris (1994)   (4 citations)  (Correct)

....recursive predicates because recursion is the only way to express iteration in logic. Moreover, global data is used to represent bindings, terms and pass arguments to procedures. In the recent past, three languages have been implemented by compiling them to C first: Janus [3] Erlang [2] and KL1 [4]. They all three belong to the class of logic languages of 13 although Erlang could as well be thought of as a functional language, but it does share some characteristics with logic. These three languages use a different basic compilation scheme and each is based on different characteristics ....

..... is given and if necessary also for the fact b. The full C code for some of the benchmarks as used for the timings, can be found in the appendices. The complete benchmark of 13 set is obtainable from the authors. We will not go into the details of the languages Janus [3] Erlang [2] and KL1 [4]: the reader is referred to the appropriate literature. 2. 1. Janus The basic approach in Janus [3] is to compile a complete program to one C function which is essentially one switch statement of which the case labels represent entries of predicates and to which jump labels are added so that the ....

[Article contains additional citation context not shown here]

T. Chikayama, T. Fujise and D. Sekita, `A Portable and Efficient Implementation of KL1', in ICOT/NSF Workshop on Parallell Logic Programming and its Programming Environments, CIS-TR-94-04, Department of Computer and Information Science, University of Oregon, March 1994.


A Simple Approach To Supporting Untagged Objects In.. - Bigot, Debray   (1 citation)  (Correct)

....for a very small part of the overall compilation time. Because Janus programs are compiled to C code which is then processed by a C compiler, most of the overall time for translation to the object code is spent in I O operations and in the C compiler (other systems that compile to C, e.g. KLIC [10], report similar experiences) As a result, there is no perceptible decrease in the overall compile time when dataflow analysis and optimizations are switched off. 5. Extensions The discussion thus far has not considered the question of backtracking, which is of fundamental importance in ....

T. Chikayama, T. Fujise, and D. Sekita, "A Portable and Efficient Implementation of KL1", Proc. Int. Symp. on Programming Language Implementation and Logic Programming, Sept. 1994, pp. 25--39

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC