2432 search results - page 243 / 487 » Cryptographic logical relations |
179
Voted
FPCA
1989
15 years 10 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
179
click to vote
CSCLP
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
164
Voted
AMAI
2004
Springer
16 years 22 hour ago
2004
Springer
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic...
161
click to vote
DLOG
1996
15 years 8 months ago
1996
To ensure the re-use of domain ontologies the usual approach relies on a pivot language, e.g., Kif, intoandfromwhich the domainontologyis translated. This requires several distinc...
139
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
: There has been an abundance of research within the last couple of decades in the area of multilevel secure (MLS) databases. Recent work in this field deals with the processing of...