PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Communication and concurrency
Metacircularity in the polymorphic &lgr;-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Selected Papers from the Internaltional Seminar on Partial Evaluation
Selected Papers from the Internaltional Seminar on Partial Evaluation
Partial Evaluation Scheme for Concurrent Languages and Its Correctness
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Static Analysis of Communication for Asynchronous Concurrent Programming Languages
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Deferred Compilation: The Automation of Run-Time Code Generation
Deferred Compilation: The Automation of Run-Time Code Generation
Partial evaluation of concurrent constraint languages
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Transformations of CCP programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial Evaluation of Concurrent Programs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
| Hi-index | 0.00 |
In this paper, we are interested in self-applicable partial evaluation for the pi-calculus, a language which models the concurrent behavior of communicating processes. We use the classic three-steps methodology. First, we write a meta-interpreter for the language. Second, we introduce an abstract analysis that determines which operations (communications) can be executed at compile-time. The notion of well-annotatedness of terms is defined. Finally, we exhibit the self-applicable partial evaluator which is applied to well-annotated terms, and we prove its correctness with respect to the interpreter. This approach is compatible with Futamura's projections. Proofs of correctness are baaed on the notion of weak reduction equivalence.