5096 search results - page 650 / 1020 » Associations as a Language Construct |
181
click to vote
ICSE
2011
IEEE-ACM
14 years 10 months ago
2011
IEEE-ACM
Developers who write code in a statically typed language are denied the ability to obtain dynamic feedback by executing their code during periods when it fails the static type che...
197
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
205
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
153
click to vote
CTRSA
2009
Springer
16 years 1 months ago
2009
Springer
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables a prover to commit a set to a verifier, without revealing even the size of the...
182
click to vote
INFOCOM
2006
IEEE
16 years 25 days ago
2006
IEEE
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...