63 search results - page 8 / 13 » On Completeness of Logical Relations for Monadic Types |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
FSEN
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
JANCL
2007
13 years 7 months ago
2007
ABSTRACT. We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consist...
TARK
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...