Jung, A., Tiuryn, J.: A new characterisation of lambda denability. Proc. TLCA. LNCS 664. Bezem and Groote (eds.) Springer (1993) 245-257. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Logical Relations and Data Abstraction - Power, Robinson (Correct)
....Working Group 6811 Applied Semantics The purpose of this paper is to show that by relaxing the de nition of logical relation, we can extend Mitchell s completeness result to higher order theories. The approach we take here has two major sources. The rst is the work of Achim Jung and Jerzy Tiuryn [5], who used a form of logical relations to characterise lambda de nability in the simple type hierarchy. The second is the thesis of Claudio Hermida [3] which explores the connection between logical predicates and logical formalisms expressed as brations de ned over the semantic category. Sadly ....
....prove the completeness part of our main result. Given equivalent interpretations F; G : D C, we seek a cartesian closed bration p : B C C and a cartesian closed functor from D to B. Our construction is motivated by Jung and Tiuryn s construction of Kripke logical relations of varying arity [5], though it corresponds to a variant and not their precise construction. It is possible to prove the result we want in a way that corresponds precisely to theirs. The construction is, however, less compact and less obviously generalisable. First, Jung and Tiuryn s choice of name is ....
Jung, A., Tiuryn, J.: A new characterisation of lambda denability. Proc. TLCA. LNCS 664. Bezem and Groote (eds.) Springer (1993) 245-257.
Logical Relations, Data Abstraction, and Structured Fibrations - Power, Robinson (Correct)
....category theoretic terms (see Mitchell [10, 11] but the results here apply to fully higher order theories, largely because of the category theoretic formalisation rather than Henkin models. The main construction we need for a converse is given by a variant of work of Achim Jung and Jerzy Tiuryn [5], who used a form of logical relations to characterise lambda de nability in the simple type hierarchy. But the work here is not based on Henkin models but rather on cartesian closed categories, so a better comparison is Alimohamed s characterisation of lambda de nability for cartesian closed ....
....prove the completeness part of our main result. Given equivalent interpretations F; G : D C, we seek a cartesian closed bration p : B C C and a cartesian closed functor from D to B. Our construction is motivated by Jung and Tiuryn s construction of Kripke logical relations of varying arity [5]. In this section, we shall largely ignore the cartesian closedness condition and concentrate only on the bration and the diagonal conditions. The key construction we need for our completeness result is as follows. Given a functor F : D C, one can turn it around to obtain a functor F : C ....
[Article contains additional citation context not shown here]
A. Jung and J. Tiuryn. A new characterisation of lambda denability. In Proc. TLCA 93, LNCS 664, pages 245-257, 1993.
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