391 search results - page 34 / 79 » Formal Universes |
128
click to vote
TLDI
2005
ACM
15 years 6 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, ...
122
click to vote
DIS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
97
Voted
STOC
1998
ACM
15 years 4 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
114
click to vote
SWWS
2007
15 years 1 months ago
2007
−The ability for software agents to discover, query, and task ubiquitous sensors requires machineinterpretable service descriptions, such as those proposed by the Semantic Web ef...
112
Voted
CCS
2005
ACM
15 years 6 months ago
2005
ACM
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...