A. Stoughton, Mechanizing Logical Relations, Proc. Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science 802, Springer-Verlag (1994). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Linear Läuchli Semantics - Blute, Scott (Correct)
....are related, i.e. for all i; R(jA (x i ) j B (x i ) Then R( M j A ; M j B ) In particular, if A = B and M is a closed term (i.e. contains no free variables) its meaning M in a model A is invariant under all logical relations. This observation has been used by Plotkin, Statman, et. al [39, 43, 44] to show certain elements (of models) are not lambda definable: it suffices to find some logical relation on A for which the element in question is not invariant. An important special case for us is the following example: Example 3.2 Consider a Henkin model A, with a specified permutation b : ....
A. Stoughton, Mechanizing Logical Relations, Proc. Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science 802, Springer-Verlag (1994).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC