G. Berry. Stable models of typed -calculi. In Proceedings of the 5th International Colloquium on Automata, Languages and Programming, number 62 in LNCS, pages 72-89. Springer, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fully Abstract Bidomain Models of the λ-Calculus - Laird (2001) (Correct)
....is used to show that the bidomain model of this fragment is fully abstract. 1 Introduction Over the past twenty ve years a great deal of e ort has been invested in the search for a semantic characterisation of sequentiality. One of the earliest candidates is Berry s notion of stability [6, 7], which is particularly attractive in that it is a simple, order theoretic concept, tting in well with Scott semantics and many of the subsequent developments in domain theory, via the notion of bidomain, which combines both orders on a single structure. It is well known that the bidomain model ....
G. Berry. Stable models of typed -calculi. In Proceedings of the 5th International Colloquium on Automata, Languages and Programming, number 62 in LNCS, pages 72-89. Springer, 1978.
Glueing and Orthogonality for Models of Linear Logic - Hyland (2001) (4 citations) (Correct)
....of domains is the usual product, the linear exponential comonad is given by lifting. The Kleisli category for the comonad is again the usual category of Scott domains and continuous maps. Examples from stable domain theory dI domains and linear maps. Let dIDom be the category of dI domains (see [13, 14]) and stable linear maps: stability is the familiar condition f(a b) f(a) f(b) for all compatible a and b. dIDom is a model for intuitionistic linear logic. Multiplicative structure. The tensor product A B classi es maps A B C stable and linear in each argument; the linear function ....
G. Berry. Stable models of typed -calculi. In Proc. of the 5th ICALP, volume 62 of Lecture Notes in Computer Science, pages 72-89. Springer-Verlag, 1978.
Geometric And Higher Order Logic In Terms Of Abstract Stone Duality - Taylor (2000) (Correct)
....In fact f 0 f is given exactly by this formula, which is known as the Berry order, since (using the universal property that de nes Y X ) the function f g X Y de ned by ( x) 7 f 0 x and ( x) 7 fx is stable i the formula holds. Stable domains were introduced by G erard Berry [Ber78] as a rst attempt to capture sequential algorithms denotationally: parallel or, with por(t; por( t) t and por(f; f) f , is not interpretable, as it is in Dcpo. Notice that the Berry order is sparser than the pointwise order on the function space; it bears some resemblance to the ....
Gerard Berry. Stable models of typed -calculi. In ICALP, Lecture Notes in Computer Science, pages 72-89. Springer-Verlag, 1978.
Information Categories - Edalat, Smyth (Correct)
....Mlb and V as well. The function space constructor, as in the case of BC ISys , gives rise to a standard and morphism continuous covariant functor on the subcategory of inclusion morphisms of SFP ISys . 7 Information systems for dI domains We now consider dI domains which were introduced in [Ber78] in the context of studying the full abstraction problem for typed calculi. Recall that a dI domain is a bounded complete (Scott) domain D which satis es the following two conditions: dI(i) for all x; y; z 2 D, if y z then x u (y t z) x u y) t (x u z) dI(ii) there are only a nite number ....
G. Berry. Stable Models of Typed -calculi. In Proceedings of the 5th International Colloquium on Automata, Languages and Programming, volume 62 of Lecture Notes in Computer Science, pages 72-89. Springer Verlag, 1978.
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