1313 search results - page 64 / 263 » Generic Universe Types |
104
click to vote
FUIN
2010
14 years 9 months ago
2010
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...
105
click to vote
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
JCST
2008
14 years 11 months ago
2008
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed...
114
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. This article presents a new open-source C++ implementation to solve the SLAM problem, which is focused on genericity, versatility and high execution speed. It is based on...
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
XML transformations are very sensitive to types: XML types describe the tags and attributes of XML elements as well as the number, kind, and order of their sub-elements. Therefore,...