M. Meier, P. Dufresne, and D-H. de Villeneuve. SEPIA. Technical report, ECRC, Munich, Germany, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
LO and Behold! Concurrent Structured Processes - Andreoli, Pareschi (1990) (3 citations) (Correct)
....example, the input device to close all its named streams before terminating. Similarly, the output device terminates only when all its input streams are closed. 4 Implementation An interpreter for executing LO programs has been implemented using the sequential logic programming environment SEPIA [17]. The coroutining facilities of SEPIA have been exploited to account for the specific control strategy described in Section 3.3.2. Obviously, the interpreted approach is quite inefficient. Indeed, the propagation proof rules IV V involve trying to match each head of a method with each subpart of ....
M. Meier, P. Dufresne, and D-H. de Villeneuve. SEPIA. Technical report, ECRC, Munich, Germany, 1988.
Linear Objects: logical processes with built-in inheritance - Andreoli, Pareschi (1991) (217 citations) (Correct)
....since there are only finitely many alternatives. ffl the choice of an instantiation of the variables in the method. This can be done via unification, just as in Prolog. 3 Examples An experimental interpreter capable of searching LO proofs has been implemented in the Prolog environment Sepia [22], developed at ECRC. Sepia supports several powerful programming facilities (like modules and coroutining) which have been exploited for the implementation of the interpreter. The examples presented in this section have been tested on this interpreter. They are divided in two categories. 3.1 ....
M. Meier, P. Dufresne, and D-H. de Villeneuve. SEPIA. Technical report, ECRC, Munich, Germany, 1988.
Linear Objects: logical processes with built-in inheritance - Andreoli, Pareschi (217 citations) (Correct)
....since there are only finitely many alternatives. ffl the choice of an instantiation of the variables in the method. This can be done via unification, just as in Prolog. 3 Examples An experimental interpreter capable of searching LO proofs has been implemented in the Prolog environment Sepia [16], developed at ECRC. Sepia supports several powerful programming facilities (like modules and coroutining) which have been exploited for the implementation of the interpreter. The examples presented in this section have been tested on this interpreter. They are divided in two categories. 3.1 ....
M. Meier, P. Dufresne, and D-H. de Villeneuve. SEPIA. Technical report, ECRC, Munich, Germany, 1988.
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