Logical Relations for Monadic Types

نویسندگان

Jean Goubault-Larrecq

Slawomir Lasota

David Nowak

چکیده

ion of the morphism 〈u, v〉 in the subscone from 〈S,m,A〉⊗̃〈S1,m1, A1〉 to 〈S2,m2, A2〉 is then the pair 〈ẽ2 ◦ ũ,Λ(v)〉 given by the diagram: S m // ũ ## Λ(u◦e.1) 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 |A|

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Logical Relation for Monadic Encapsulation of State

We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent. Furthermore, we show that contextual ...

متن کامل

Inductive and Coinductive Session Types in Higher-Order Concurrent Programs

We develop a theory of inductive and coinductive session types in a computational interpretation of linear logic, enabling the representation of potentially infinite interactions in a compositionally sound way that preserves logical soundness, a major stepping stone towards a full dependent type theory for expressing and reasoning about session-based concurrent higher order distributed programs...

متن کامل

Complete Lax Logical Relations for Cryptographic Lambda-Calculi

Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equivalence in typed lambda calculi, see e.g. Sumii and Pierce’s logical relation for a cryptographic lambda-calculus. We clarify Sumii and Pierce’s approach, showing that the right tool is prelogical relations, or lax logical relatio...

متن کامل

On Completeness of Logical Relations for Monadic Types

Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs can be modeled in the framework of lambda-calculi, and interesting properties can be expressed formally by contextual equivalence (a.k.a. observational equivalence). Furthermore, imperative features, which exist in most real-lif...

متن کامل