63 search results - page 1 / 13 » On Completeness of Logical Relations for Monadic Types |
ASIAN
2006
Springer
13 years 8 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
MSCS
2008
13 years 4 months ago
2008
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
PODS
1999
ACM
13 years 8 months ago
1999
ACM
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...