Fully abstract semantics of additive aspects by translation

ACM International Conference Proceeding Series

Volumn 208, Issue , 2007, Pages 135-148

  Sanjabi, S B ^a   Ong, C H L ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Aspect oriented programming; Aspects; Full abstraction; Game semantics; Translation

Indexed keywords

ABSTRACTING; COMPUTATION THEORY; COMPUTER AIDED LANGUAGE TRANSLATION; ENCODING (SYMBOLS); MACHINE ORIENTED LANGUAGES; OBJECT ORIENTED PROGRAMMING;

ASPECT ORIENTED PROGRAMMING; FULL ABSTRACTION; GAME SEMANTICS;

SEMANTICS;

EID: 34548232221     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1218563.1218579     Document Type: Conference Paper

References (19)

1. th International Conference, on Tools and Algorithms for the Construction, and Analysis of Systems (TACAS '04), volume 2988 of Lecture Notes in Computer Science, pages 421-435. Springer-Verlag, 2004.
2. th Annual IEEE Symposium on Logic in Computer Science (LICS '98), pages 334-344. IEEE Computer Society Press, 1998.
3. th European Conference on Object-Oriented Programming (ECOOP '05), volume 3586 of Lecture Notes in Computer Science, pages 144-168. Springer-Verlag, 2005.
4. J. H. Andrews. Process algebraic foundations of aspect oriented programming. In Proceedings of the International Conference on Metalevel Architectures and Separation of Crosscutting Concerns (Reflection 2001), volume 2192 of Lecture Notes In Computer Science. Springer-Verlag, 2001.
5. th International Conference on Concurrency Theory (CONCUR '04), volume 3.170 of Lecture Notes in Computer Science, pages 209-224. Springer-Verlag, September 2004.
6. rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '06), pages 383-396. ACM Press, 2006.
7. R. E. Filman and D. P. Friedman. Aspect-oriented programming is quantification and obliviousness. In OOPSLA Workshop on Advanced Separation of Concerns, Minneapolis, USA, October 2000.
8. D. Ghica and G. McCusker. The regular-language semantics of second-order idealised algol. Theoretical Computer Science, 309(1):469-502, 2003.
9. th Annual IEEE Symposium on Logic in Computer Science (LICS '97), page 76. IEEE Computer Society Press, 1997.
10. th European Conference on Object-Oriented Programming (ECOOP '01), volume 2072 of Lecture Notes in Computer Science, pages 327-353. Springer-Verlag, February 2001.
11. th Annual IEEE Symposium, on Logic in Computer Science (LICS '01), pages 105-114. IEEE Computer Society Press, 2001.
12. I. A. Mason and C. L. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1(3):287-327, 1991.
13. G. McCusker. Full abstraction by translation. In Proceedings of the Third Workshop of the Theory and Formal Methods Section, Department of Computing, Imperial College, London, 1996.
14. C.-H. L. Ong. Correspondence between operational and denotational semantics: the full abstraction problem for PCF. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 4, pages 269-356. Oxford University Press, 1995.
15. A. M. Pitts and I. Stark. Operational reasoning for functions with local state. In Andrew Gordon and Andrew Pitts, editors, Higher Order Operational Techniques in Semantics, pages 227-273. Publications of the Newton Institute, Cambridge University Press, 1998.
16. J. C. Reynolds. The essence of Algol. In. J. W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages, pages 345-372. North-Holland Publishing Company, Amsterdam, 1981.
17. th Annual ACM Symposium on Principles of Programming Languages (POPL '91), pages 245-254, Orlando, Florida, 1991.
18. th ACM SIGPLAN International Conference on Functional Programming (ICFP '03), pages 127-139, Uppsala, Sweden, August 2003. ACM Press.
19. M. Wand, G. Kiczales, and C. Dutchyn. A. semantics for advice and dynamic join points in aspect oriented programming. Transactions on Programming Languages and Systems (TOPLAS), 26(5):890-910, September 2004.