Theoretical Computer Science
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Programming in Lygon: An Overview
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Aspect-Oriented Logic Meta Programming
Reflection '99 Proceedings of the Second International Conference on Meta-Level Architectures and Reflection
System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A semantics for advice and dynamic join points in aspect-oriented programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Aspectual Caml: an aspect-oriented functional language
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause Prolog provide richer abstraction and control mechanisms. Definite clauses that pertain to a common aspect, and which crosscut other program components, can be encapsulated using the connectives of higher-order intuitionistic logic. The integration or weaving of program fragments can be formulated using normalized forms of proof search in linear logic.