3658 search results - page 669 / 732 » The logic of proofs, semantically |
PLDI
2010
ACM
14 years 5 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
ESAS
2004
Springer
14 years 1 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
ASIACRYPT
2001
Springer
14 years 18 days ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...