Foundations of logic programming
Foundations of logic programming
Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Proceedings of the 4th conference on Logic programming '85
Theoretical Computer Science
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Parallel logic programming
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Concurrent constraint programming
Concurrent constraint programming
From concurrent logic programming to concurrent constraint programming
Advances in logic programming theory
From logic programming to Prolog
From logic programming to Prolog
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Resource-Passing Concurrent Programming
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
A Portable and Efficient Implementation of KL1
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Rewriting Implementation of pi-calculus
A Rewriting Implementation of pi-calculus
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
| Hi-index | 0.00 |
We formalize a translation of an asynchronous Pi-calculus into Flat GHC which does not disrupt too much the intuitive correspondence between them, specially in which regards names vs. logical variables. However, our approach depends on the introduction of some artifacts, namely channel managers. Contrasting other studies, here the communication between managers and other processes is asynchronous. Although this approach is justified by a relaxed notion of compositionality for process algebras, we still need some methodology that allows us to reason about programs in the presence of managers. We show how techniques from program transformation and a form of dynamic search strategy can cope with this. The encoding has been implemented in Haskell and executable programs are obtained from asynchronous Pi-calculus specifications by means of the KLIC compiler. Alternatively, we have developed in Prolog an interpreter for Flat GHC that has proven useful to analyze aspects of the translation.