123 search results - page 23 / 25 » Semantic Generalisation and the Inference of Meaning |
101
click to vote
FOAL
2007
ACM
15 years 3 months ago
2007
ACM
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
172
click to vote
POPL
2005
ACM
15 years 12 months ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
193
click to vote
POPL
2004
ACM
15 years 12 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
209
click to vote
POPL
2003
ACM
15 years 12 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...