Arranging language features for more robust pattern-based crosscuts
Proceedings of the 2nd international conference on Aspect-oriented software development
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
AspectS - Aspect-Oriented Programming with Squeak
NODe '02 Revised Papers from the International Conference NetObjectDays on Objects, Components, Architectures, Services, and Applications for a Networked World
What does aspect-oriented programming mean to Cobol?
Proceedings of the 4th international conference on Aspect-oriented software development
Fine-grained interoperability through mirrors and contracts
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Detecting and resolving ambiguities caused by inter-dependent introductions
Proceedings of the 5th international conference on Aspect-oriented software development
Forward chaining in HALO: an implementation strategy for history-based logic pointcuts
ICDL '07 Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007
Modularizing crosscuts in an e-commerce application in Lisp using HALO
Proceedings of the 2007 International Lisp Conference
Inter-language reflection: A conceptual model and its implementation
Computer Languages, Systems and Structures
Application-specific models and pointcuts using a logic meta language
ISC'06 Proceedings of the 14th international conference on Advances in smalltalk
Expressive pointcuts for increased modularity
ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
Hi-index | 0.00 |
Within aspect-oriented programming, the quality of aspect code depends on the readability and expressiveness of pointcut languages. Readability is increased by using specialized, declarative pointcut languages. For such languages, their expressiveness is increased if they offer an integration with the base code language. As has previously been shown, offering access to the past history of the base program also increases pointcut expressiveness. A logical desire then is creating pointcut languages that combine both features, but taken to the extreme this is not implementable. We discuss the unimplementable ideal model of declarative history-based logic pointcut languages, and the possible approximations that can be made that are still implementable and what limits they impose on the ideal expressiveness.