Sciweavers

400 search results - page 1 / 80
» Logical relations for monadic types
Sort
View
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
13 years 8 months ago
On Completeness of Logical Relations for Monadic Types
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 ...
Slawomir Lasota, David Nowak, Yu Zhang
MSCS
2008
97views more  MSCS 2008»
13 years 4 months ago
Logical relations for monadic types
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...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
CSL
2004
Springer
13 years 10 months ago
Complete Lax Logical Relations for Cryptographic Lambda-Calculi
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
FOSSACS
2010
Springer
13 years 11 months ago
Monads Need Not Be Endofunctors
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
PODS
1999
ACM
89views Database» more  PODS 1999»
13 years 9 months ago
Type Inference in the Polymorphic Relational Algebra
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...
Jan Van den Bussche, Emmanuel Waller