Self-applicable partial evaluation for the pi-calculus

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 1997, Pages 36-46

  Gengler, Marc ^a   Martel, Matthieu ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Bindmg time analysis; Meta interpretation; Parallelism; Partial evaluation; Pi calculus

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; SEMANTICS; COMPUTATIONAL LINGUISTICS; ENCODING (SYMBOLS); EQUIVALENCE CLASSES; FORMAL LANGUAGES; PROGRAM INTERPRETERS;

BINDMG-TIME ANALYSIS; META-INTERPRETATION; PARALLELISM; PARTIAL EVALUATION; PI CALCULUS;

CALCULATIONS; COMPUTER SOFTWARE;

BINDING TIME ANALYSIS; META INTERPRETATION; PARALLELISM; PARTIAL EVALUATION; PI-CALCULUS;

EID: 0030649558     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258993.259000     Document Type: Conference Paper

References (17)

1. Olivier Danvy, Robert Glück, and Peter Thiemann, editors. Partial Evaluation, Volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
2. Carsten K. Gomard and Neil D. Jones. A partial evalu-ator for the untyped lambda-calculus. Journal of Functional Programming, l(l):21-69, January 1991.
3. Haruo Hosoya, Naoki Kobayashi, and Akinori Yonezawa. Partial evaluation scheme for concurrent languages and its correctness. In Euro-par'96, Volume 1123 of Lecture Notes in Computer Science, pages 625-632. Springer-Verlag, 1996.
4. Naoki Kobayashi, Motoki Nakade, and Akinori Yonezawa. Static analysis of communications for asynchronous concurrent programming languages. In SAS'95, Volume983 of Lecture Notes in Computer Science, pages 225-242. Springer-Verlag, 1995.
5. Peter Lee and Mark Leone. Deferred compilation: The automation of run-time code generation. Technical report, School of Computer Science, Carnegie Mellon University, Pittsburgh, December 1993.
6. Murakami Masaki. Partial evaluation of reactive communicating processes using temporal logic formulas and its applications. In Proc. of Workshop on Algebraic and Object-Oriented Approaches to Software Science, 1995.
7. Hidehiko Masuhara, Satoshi Matsuoka, and Akinori Yonezawa. Implementing parallel language constructs using a reflective object-oriented language. In Reflex-ion'96, Volume 1123 of Lecture Notes in Computer Science, pages 625-632. Springer-Verlag, 1996.
8. Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
9. Robin Milner. The polyadic 7r-calculus: a tutorial. October 1991.
10. Torben M Mogensen Efficient self-interpretation in lambda calculus. Journal of Functional Programming, 2(3):345-364, July 1992.
11. Torben M. Mogensen Self-applicable partial evaluation for pure lambda calculus. In Partial Evaluation and Semantics-Based Program Manipulation, San Francisco, California, June 1992 (Technical Report YALEU/DCS/RR-909), pages 116-121. New Haven, CT: Yale University, 1992.
12. Jens Palsberg. Correctness of binding-time analysis. Journal of Functional Programming, 3(3):347-363, July 1993.
13. Frank Pfenning and Conal Elliot. Higher-order abstract syntax. In Programming Language Design and Implementation, Atlanta, Georgia, 1988.
14. Frank Pfenning and Peter Lee. Metacircularity in the polymorphic λ-calculus. Theoretical Computer Science, 89:137-159, 1991.
15. Benjamin C. Pierce and David N. Turner. Pict Language Definition, Version 3.9d, 1996.
16. David Walker. Objects and the pi-calculus. Information and Computation, 1995.
17. Mitchell Wand. Specifying the correctness of binding-time analysis. Journal of Functional Programming, 3(3):365-387, July 1993.