8 citations found. Retrieving documents...
L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, 7(3):314--328, 1995.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Functions, Concurrency, Distribution and Mobility - Kirli   (Correct)

....type and effect system for a subset of Facile along with a type inference algorithm [64] 5.6 Formal foundations A clean and well understood semantics has been the main motivation from the very early days of Facile. This has lead to a number of works for the formal foundations of Facile such as [62, 65, 66]. It continues to be of interest to researchers of process calculi. 5.7 Applications The focus of Facile is to provide a well founded platform to support the development of end user applications rather than system software. An effort has been made to enable Facile implementations in a network of ....

L. Leth and B. Thomsen. Some facile chemistry. Formal Aspects of Computing, 7(E):67--110, 1995.


Understanding Mobile Agents via a non-interleaving .. - Borgia, Degano.. (1996)   (2 citations)  Self-citation (Leth Thomsen)   (Correct)

....managed. Communication is synchronous. The functional and the concurrent parts of Facile are strongly integrated: processes evaluate expressions to values while expressions may activate processes or return channels and node identifiers. The semantics of Facile has been studied quite extensively [9, 10, 18, 12, 2], either focusing on defining the (abstract) execution of programs in terms of transition systems, reduction systems or abstract machines, or being concerned with the development of program equivalences. So far the approach to semantics for Facile has been based on the interleaving approach to ....

L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, Volume 7, Number 3, pages 314--328, 1995.


Causality for Debugging Mobile Agents - Degano, Priami, Leth, Thomsen (1996)   Self-citation (Leth Thomsen)   (Correct)

....managed. Communication is synchronous. The functional and the concurrent parts of Facile are strongly integrated: processes evaluate expressions to values while expressions may activate processes or return channels and node identifiers. The semantics of Facile has been studied quite extensively [15, 16, 30, 20, 2], either focusing on defining the (abstract) execution of programs in terms of transition systems, reduction systems or abstract machines, or being concerned with the development of program equivalences. So far the approach to semantics for Facile has been based on the interleaving approach to ....

L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, Volume 7, Number 3, pages 314--328, 1995.


Analysis of Facile Programs: a Case Study - Degano, Priami, Leth, Thomsen (1996)   (2 citations)  Self-citation (Leth Thomsen)   (Correct)

....managed. Communication is synchronous. The functional and the concurrent parts of Facile are strongly integrated: processes evaluate expressions to values while expressions may activate processes or return channels and node identifiers. The semantics of Facile has been studied quite extensively [9, 10, 14, 11, 1], either focusing on defining the (abstract) execution of programs in terms of transition systems, reduction systems or abstract machines, or being concerned with the development of program equivalences. So far the approach to semantics for Facile has been based on the interleaving approach to ....

L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, Volume 7, Number 3, pages 314--328, 1995.


Understanding Mobile Agents via a non-interleaving .. - Borgia, Degano.. (1996)   (2 citations)  Self-citation (Leth Thomsen)   (Correct)

....managed. Communication is synchronous. The functional and the concurrent parts of Facile are strongly integrated: processes evaluate expressions to values while expressions may activate processes or return channels and node identifiers. The semantics of Facile has been studied quite extensively [10, 11, 19, 14, 2], focusing on defining the (abstract) execution of programs in terms of transition systems, reduction systems or abstract machines or are concerned with the development of program equivalences. So far the approach to semantics for Facile has been based on the interleaving approach to modeling ....

....implemented in Facile. Finally, in section 6 we give some concluding remarks. 2 Facile In this paper, we only consider the concurrent functional core of Facile. This core contains the set of constructs which is sufficient to define any Facile program running on a single virtual node. We refer to [19, 14] for details about physical distribution in Facile. The syntax consists of two parts: expressions (functions) E and behaviour expressions (processes) BE. Expressions are statically typed, and t ranges over types. We assume that all expressions are correctly typed. The type system is reported in ....

L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, Volume 7, Number 3, pages 314--328, 1995.


Understanding Mobile Agents via a non-interleaving semantics.. - Borgia Degano (1996)   (2 citations)  Self-citation (Leth Thomsen)   (Correct)

....managed. Communication is synchronous. The functional and the concurrent parts of Facile are strongly integrated: processes evaluate expressions to values while expressions may activate processes or return channels and node identifiers. The semantics of Facile has been studied quite extensively [9, 10, 17, 12, 2], focusing on defining the (abstract) execution of programs in terms of transition systems, reduction systems or abstract machines or are concerned with the development of program equivalences. So far the approach to semantics for Facile has been based on the interleaving approach to modeling ....

....in Facile. Finally, in section 6 we give some concluding remarks. 2 Facile In this paper, we only consider the concurrent functional core of Facile. This core contains the set of constructs which is sufficient to define any Facile program running on a single virtual node. We refer to [17, 12] for details about physical distribution in Facile. The syntax consists of two parts: expressions (functions) E and behaviour expressions (processes) BE. Expressions are statically typed, and t ranges over types. We assume that all expressions are correctly typed. The type system is reported in ....

L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, Volume 7, Number 3, pages 314--328, 1995.


What is a `Good' Encoding of Guarded Choice? - Nestmann (1997)   (Correct)

No context found.

L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, 7(3):314--328, 1995.


A Model for Declarative Programming and Specification with.. - Caires (1999)   (Correct)

No context found.

L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, 7(3):314-328, 1995.

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