A Kripke logical relation for effect-based program transformations

A Kripke Logical Relation Between ML and Assembly Technical Appendix

Kripke Semantics for a Logical Framework

We present a semantics (using Kripke lambda models) for a logical framework (minimal implicational predicate logic with quantiication over all higher types). We apply the semantics to obtain straightforward adequacy proofs for encodings of logics in the framework.

Correctness of effect-based program transformations

We consider a type system capable of tracking reading, writing and allocation in a higher-order language with dynamically allocated references. We give a denotational semantics to this type system which allows us to validate a number of effect-dependent program equivalences in the sense of observational equivalence. An example is the following: x = e; y = e; e′(x, y) is equivalent to x = e; e′(...

Kripke Logical Relations and PCF

Sieber has described a model of PCF consisting of continuous functions that are invariant under certain ((nitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of \Kripke logical relations" introduced by Jung and Tiuryn to characterize-deenability.

Dependency based logical form transformations

This paper describes a system developed for the transformation of English sentences into a first order logical form representation. The metho dology is centered on the use of a dependency grammar based parser . We demonstrate the suitability of applying a dependency parser based solution to the given task and in turn explain some of the limitations and challenges involved when using such an app...