Sciweavers

17 search results - page 3 / 4
» Equality and hashing for (almost) free: Generating implement...
Sort
View
POPL
2010
ACM
14 years 3 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
ML
2006
ACM
103views Machine Learning» more  ML 2006»
13 years 11 months ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...
IJAC
2008
84views more  IJAC 2008»
13 years 5 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
14 years 11 days ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev
SAIG
2000
Springer
13 years 9 months ago
Compiling Embedded Languages
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
Conal Elliott, Sigbjorn Finne, Oege de Moor