Citations: On full abstraction for PCF - Hyland, Ong (ResearchIndex)

68 citations found. Retrieving documents...

J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II, and III. Inf. Comput., 163(2):285--408, 2000.

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

First 50 documents Next 50

"Wave-style" Geometry of Interaction Models are Graph-like.. - Honsell, Lenisa (Correct)

....does not satisfy the condition of Definition 10 on the empty relation. 4. 2 Wave GoI # theories The class of # theories induced by wave models is quite rich, or at least it goes beyond theories where all unsolvable of order 0 are equated in the bottom element, as in models based on games a la [AJM00,HO00] (see [DFH99] Namely: Lemma 1. For any k 0, there exists a GoI algebra on (Rel # , # , ## f ) with k self singletons (up to #) di#erent from #, i.e. elements a U such that # # 1 (a, a) a and # # 2 ( a, # ) a. One can easily check that any self singleton (up to #) a belongs ....

M.Hyland, L.Ong. On full abstraction for PCF, Inf. and Comp. 163, 2000.

Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)

....proposing and verifying the new typing systems for secure programming languages based on linear affine typed p calculi, where strong normalisability and linearity play a fundamental role in the analysis. One of the basic aspects of the type structure in the present work, input output modes (cf. [4, 37, 50, 53]) has its incarnation in the context of Linear Logic, yielding its variant called Polarised Linear Logic (LLP) 47, 48] studied by Olivier Laurent. Proof nets for LLP are faithfully embeddable in the replicated fragment of the present calculus (i.e. the sub calculus which only use types) ....

....equality, the output x( y)Q acts like (n y) xh yijQ) in the standard syntax. The reduction relation and the structural congruence are defined in Figure 1. The multi step reduction is given as = As a simple example of processes and their reductions, a copy cat agent [37] is given by [x y] x(c) y(c )c 0 :c, which links two locations x and y. The omega agent is defined as W u = ny) u y]j[y u] which immediately diverges when it is interrogated at u. 2.1. Types Action Modes. The following pairs of action modes [11, 32] prescribe how each ....

[Article contains additional citation context not shown here]

Hyland, M. and Ong, L., "On Full Abstraction for PCF": I, II and III. Info. & Comp. 163 (2000), 285-408.

Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)

....) except that no free channels are suppressed (if a channel is under replication then it can be used more than once) Out ) and (Weak ) say that channels occur zero or more times and do not suppress actions. Example 2. 2 A copy cat copies all information from one channel to another [4, 25]. We show, step by step, how [u x] u(a) x(b)b:a, the copy cat from u to x, can be typed. Let t = G = a : b : u : t x : t. Then: 1) G 0 . 0, 2) G a. a, 3) G b:a. # b a, 4) Gnb x(b)b:a . a (by (# b a) b = a) and finally (5) Gnab ....

....via Theorem 3.9, the context to be in NF e , we obtain P j R j and Q of desired types. We then transform each R j and Q to their sequential variants, using Lemma 5.2. See Appendix D.7. The final step is to show that each process with l ; types is translatable to a canonical normal form [4, 25] (CNF) whose grammar is given below. F : j x j lx:F j hF 1 ; F 2 i j in i (F) j let ( z in F j let x = zF in F let hx;yi = z in F j case x of fin i (x i ) F i g We omit the typing and reduction rules. CNFs are translated to l ; terms in the standard way without changing meaning up ....

Hyland, M. and Ong, L., "On Full Abstraction for PCF": I, II and III. Info. & Comp. 163 (2000).

Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001) (1 citation) (Correct)

....universe which, among others, includes concurrency and non determinism, o ering a uniform basis on which various semantic ndings can be integrated and extensions considered. A signi cant point in this context is the close connection between the presented calculus and game semantics [3, 22, 25]: the structure of interaction of typed processes (with respect to typed environments) precisely conforms to the intensional structures of games introduced in [25] and studied in e.g. 2, 12, 22, 27, 28] It is notable that the type discipline itself does not mention basic notions in game ....

....considered. A signi cant point in this context is the close connection between the presented calculus and game semantics [3, 22, 25] the structure of interaction of typed processes (with respect to typed environments) precisely conforms to the intensional structures of games introduced in [25] and studied in e.g. 2, 12, 22, 27, 28] It is notable that the type discipline itself does not mention basic notions in game semantics such as visibility, well bracketing and innocence (although it does use a syntactic form of IO alternation) yet they are derivable as operational properties of ....

[Article contains additional citation context not shown here]

Hyland, M. and Ong, L., On Full Abstraction for PCF: I, II and III. 130 pages, 1994. To appear in Info. & Comp.

Linearity, Sharing and State: a fully abstract game.. - Abramsky, McCusker (1997) (2 citations) (Correct)

....do faithfully reflect the concepts in the language, and capture the operational behaviour of programs. We can in fact do this in a very strong sense. As we shall see in Section 6, the categories of games used to give the first syntax independent constructions of fully abstract models for PCF [2, 11], when used to give models for IA Gamma fnewg in the way we have described, again yield fully abstract models. Moreover, the proof of full abstraction is a very easy extension of that for PCF, and can be given at the axiomatic level introduced in [1] This latter point means that any model of the ....

....knowing. The category G inn was introduced in [13, 14] and used there to construct a fully abstract model for FPC, a functional language with sums, products, functions and recursive types. It is a generalization of Hyland and Ong s previous category of dialogue games and innocent strategies [11], with many improvements in definitions, presentation and identification of key lemmas based on the ideas in [2] Most of the verification that the structures described below have the required properties is identical to that for the categories described in [13] so we shall refer extensively to ....

[Article contains additional citation context not shown here]

M. Hyland and C.H. L. Ong. On full abstraction for PCF. Submitted for publication, 1996.

Bistructures, Bidomains and Linear Logic - Curien, Plotkin, Winskel (1997) (Correct)

.... category of concrete data structures and sequential algorithms [5] may be obtained as the co Kleisli category of a games model [6, 16] The connection between games and sequentiality has in turn informed recent work on intensional models of PCF and their fully abstract extensional collapse [1, 12]. After Berry isolated the mathematically natural notion of stability [3] it was soon realized that sequential functions are stable. While there is a cartesian closed category of stable functions, at higher orders the extensional ordering is not respected. It was therefore natural for Berry to ....

Hyland, J.M.E., and Ong, C-H.L., On full abstraction for PCF: I, II and III, available by ftp at ftp.comlab.ox.ac.uk, in directory /pub/Documents/techpapers/Luke.Ong/pcf.ps.gz, 1994.

Nominal Games and Full Abstraction for the Nu-Calculus - Abramsky, Ghica.. Self-citation (Ong) (Correct)

No context found.

J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I, II, III Info. & Comp., 163:285--408, 2000.

Games for Controls - Chatterjee, Jagadeesan, Pitcher (2006) (Correct)

No context found.

J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II, and III. Inf. Comput., 163(2):285--408, 2000.

Comparing Hierarchies of Types in Models of Linear Logic - Mellies (2003) (1 citation) (Correct)

No context found.

M. Hyland and L. Ong. On full abstraction for PCF. In Information and Computation, Volume 163, pp. 285-408, December 2000.

Linearity and Bisimulation - Yoshida, Honda, Berger (2002) (7 citations) (Correct)

No context found.

Hyland, M. and Ong, L., "On Full Abstraction for PCF": I, II and III. Info. & Comp. 163 (2000), 285-408, 2000. 15

Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001) (Correct)

No context found.

Hyland, M. and Ong, L., On Full Abstraction for PCF: I, II and III. 130 pages, 1994. To appear in Info. & Comp.

Linearity and Bisimulation - Yoshida, Honda, Berger (7 citations) (Correct)