5904 search results - page 504 / 1181 » Requirements for a Composition Language |
317
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
162
click to vote
OOPSLA
2009
Springer
16 years 1 months ago
2009
Springer
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
188
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
225
click to vote
KCAP
2005
ACM
16 years 22 days ago
2005
ACM
An ultimate goal of AI is to build end-to-end systems that interpret natural language, reason over the resulting logical forms, and perform actions based on that reasoning. This r...
154
click to vote
PLDI
2000
ACM
15 years 11 months ago
2000
ACM
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...