T. Chikayama, T. Fujise, and D. Sekita. A Portable and E#cient Implementation of KL1. In Proc. Sixth Int. Symp. on Programming Language Implementation and Logic Programming (PLILP'94), number 844 in LNCS, pages 25--39. Springer, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Automated Programming Framework Using - Constraint-Based Static Analysis (Correct)
....programs assuming strong moding and typing of Moded Flat GHC. KL1 is designed based on Flat GHC that is not equipped with strong moding typing, but the debugging of KL1 programs turns out to benefit from moding and typing. Furthermore, its compiler KLIC provides a nice platform for our experiments [6]. 1.4 Contributions We have implemented the Kima system, which automatically corrects wrong occurrences of logical variables in KL1 programs under strong moding and typing in the absence of the declarations of programs. The function of the Kima sounds quite restrictive, but is justified in the ....
....append(Y,Y,Z) 59 Types do not help much in this example, although Alternative (5) is given a low priority by Heuristic Rule 2 with respect to types (Section 4.4. 1) Further, if the elements of the input lists received by append were not of list type on the caller side (e.g. append( 1,2,3] [4,5,6],Out) and this information was available, Alternative (5) would have been eliminated. Additionally, Heuristic Rule 1 imposes penalty points on Alternatives (3) 4) 5) and (6) Heuristic Rule 1.1, 1.2 and 1.3 are applied to all of them, and Heuristic Rule 1.4 are applied to Alternatives (5) and ....
T. Chikayama, T. Fujise, and D. Sekita. A Portable and E#cient Implementation of KL1. In Proc. Sixth Int. Symp. on Programming Language Implementation and Logic Programming (PLILP'94), number 844 in LNCS, pages 25--39. Springer, 1994.
A Pure Meta-Interpreter for Flat GHC, A Concurrent Constraint.. - Ueda (Correct)
....you like. The only built in primitives the exec 2 program is allowed to use are those definable using (a possible infinite number of) guarded clauses. Other primitives are considered extralogical and are ruled out. Observing this constraint will enable the resulting interpreter to run on KLIC [6], which is in our context considered as a (Flat) GHC to C compiler and its runtime system. Flat GHC and KLIC carefully rule out extralogical built in primitives because they can potentially hamper e#cient implementation and theoretical support. A solution to the problem is not obvious because ....
Chikayama, T., Fujise, T. and Sekita, D., A Portable and E#cient Implementation of KL1. In Proc. 6th Int. Symp. on Programming Language Implementation and Logic Programming (PLILP'94), LNCS 844, Springer-Verlag, Berlin, 1994, pp. 25-- 39.
Resource-Passing Concurrent Programming - Ueda (2 citations) (Correct)
....is implemented so that its field may itself represent an uninstantiated logical variable, the structure cannot be recycled until the variable is instantiated (through an internal pointer to the variable) and read. Most implementations of Prolog and concurrent logic languages (including KLIC [7]) represent structures this way for e#ciency reasons, in which case local reuse requires strictness analysis, namely the analysis of instantiation states of variables, in addition to linearity analysis. The implementation of KL1 on the Parallel Inference Machine disallowed internal pointers to ....
Chikayama, T., Fujise, T. and Sekita, D., A Portable and E#cient Implementation of KL1. In Proc. 6th Int. Symp. on Programming Language Implementation and Logic Programming (PLILP'94), LNCS 844, Springer-Verlag, 1994, pp. 25--39.
Kima: an Automated Error Correction System for Concurrent Logic .. - Ajiro, Ueda (2000) (Correct)
....program assuming strong moding and typing of Moded Flat GHC. KL1 is designed based on Flat GHC that is not equipped with strong moding typing, but the debugging of KL1 programs turns out to benefit from moding and typing. Furthermore, its compiler KLIC provides a nice platform for our experiments [3]. We have obtained promising results from our experiments with the assistance of other syntactical constraints (Sect. 5) 3 2 Strong Moding and Typing in Concurrent Logic Programming We outline the mode system of Moded Flat GHC. The readers are referred to [9] and [10] for details. In ....
Chikayama, T., Fujise, T. and Sekita, D., A Portable and E#cient Implementation of KL1. In Proc. Sixth Int. Symp. on Programming Language Implementation and Logic Programming (PLILP'94), LNCS 844, Springer, 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