Context-Oriented Programming

Proceedings of the Third ACM International Workshop on Data Engineering for Wireless and Mobile Access: MobiDE 2003

Volumn , Issue , 2003, Pages 9-16

  Keays, Roger ^a   Rakotonirainy, Andry ^b  

^a Ninth Ave ^*  (Australia)

^b QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Context; Context oriented programming; Mobile; Pervasive; Programming; Ubiquitous

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE PORTABILITY; MOBILE COMPUTING; SEMANTICS; SOFTWARE ENGINEERING;

CONTEXT-ORIENTED PROGRAMMING (COP); SYNTAX;

CONTEXT SENSITIVE LANGUAGES;

EID: 1542287399     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/940923.940926     Document Type: Conference Paper

References (8)

1. Luca Cardelli and Andrew D. Gordon. Mobile ambients. Theoretical Computer Science, 240/1:177-213, June 2000. Special Issue on Coordination, D. Le Mtayer Editor.
2. Keith Cheverst, Nigel Davies, Keith Mitchell, and Adrian Friday. Experiences of developing and deploying a context-aware tourist guide: the GUIDE project. In Proc. of MOBICOM'2000, Boston, ACM Press., 2000, pages 20-31, 2000.
3. A. Dey and G. Abowd. Towards a better understanding of context and context-awareness. In Proceedings Conference on Human Factors in Computing Systems: Workshop on the What, Who, Where, When and How of Context-Awareness., 2000.
4. Shasha D. et al. Exact and approximate algorithms for unordered tree matching. IEEE Transactions on Systems, Man and Cybernetics., 24(4), April 1994.
5. Masatomo Hashimoto and Atsushi Ohori. A typed context calculus. Theoretical Computer Science, 266(1-2):249-272, 2001.
6. D. Sands. Computing with contexts: A simple approach. In A. D. Gordon, A. M. Pitts, and C. L. Talcott, editors, Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), volume 10 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers B.V., 1998.
7. R. Sethi. Programming Languages Concepts and Constructs. Addison-Wesley Publishing Company., 1989.
8. J. et al. Wang. An algorithm for finding the largest approximately common substructures of two trees. IEEE Transactions on Pattern Analysis and Machine Intelligence., 20(8), 1998.