3 search results - page 1 / 1 » Horn Programming in Linear Logic Is NP-Complete |
LICS
1992
IEEE
13 years 10 months ago
1992
IEEE
PADL
2007
Springer
14 years 14 days ago
2007
Springer
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
ICFP
2007
ACM
14 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...