## Axioms for Definability and Full Completeness (2000)

Venue: | in Proof, Language and Interaction: Essays in Honour of Robin |

Citations: | 4 - 1 self |

### BibTeX

@INPROCEEDINGS{Abramsky00axiomsfor,

author = {Samson Abramsky},

title = {Axioms for Definability and Full Completeness},

booktitle = {in Proof, Language and Interaction: Essays in Honour of Robin},

year = {2000},

pages = {55--75},

publisher = {MIT Press}

}

### OpenURL

### Abstract

ion problem for PCF (see [BCL86, Cur93, Ong95] for surveys). The importance of full abstraction for the semantics of programming languages is that it is one of the few quality filters we have. Specifically, it provides a clear criterion for assessing how definitive a semantic analysis of some language is. It must be admitted that to date the quest for fully abstract models has not yielded many obvious applications; but it has generated much of the deepest work in semantics. Perhaps it is early days yet. Recently, game semantics has been used to give the first syntax-independent constructions of fully abstract models for a number of programming languages, including PCF [AJM96, HO96, Nic94], richer functional languages [AM95, McC96b, McC96a, HY97], and languages with non-functional features such as reference types and non-local control constructs [AM97c, AM97b, AM97a, Lai97]. A noteworthy feature is that the key definability results for the richer languages are proved by a reduction to...

### Citations

1063 |
Introduction to lattices and order
- DAVEY, PRIESTLEY
- 1990
(Show Context)
Citation Context ...tion. The motivation for this terminology comes from lattice theory (Joyal is generalizing Whitman's theorem on free lattices). A -atom in a lattice (also often called a meet-irreducible element, cf. =-=[DP90]-=-) is an element a such that n i=1 a isa =) 9i: a isa: Generalizing from posets to (enriched) categories, we get the definition given above. An object B is discrete if for each A the canonical map C s ... |

397 |
LCF considered as a programming language
- Plotkin
- 1977
(Show Context)
Citation Context ...le. Theorem 6.1 (Computational Adequacy) If C is continuously observable then K ! (C) is a computationally adequate model of PCF. The original proof by Plotkin for the Scott continuous function model =-=[Plo77]-=- goes through in our axiomatic setting (cf. [Bra97]). In practice, it is often more convenient to verify somewhat stronger axioms. We say that a sequential category C is normed if: 10 ffl It is enrich... |

352 |
Proofs and Types
- Girard, Lafont, et al.
- 1989
(Show Context)
Citation Context ...tesian closed category generated by the one-object one-morphism category. More general characterization results can probably be developed along similar lines. Since under the Curry-Howard isomorphism =-=[GLT89]-=- the pure simply-typed -calculus corresponds to minimal implicational logic, this result has some relevance for Proof Theory. An interesting contrast with the full completeness results proved for Mult... |

313 |
Functions as processes, in
- Milner
- 1990
(Show Context)
Citation Context ...nal level, and as shown in detail in [AJM96], the difference is insignificant as far as observational equivalence is concerned. The operational semantics is defined via a structural congruence j (cf. =-=[Mil92]-=-) and an evaluation relation + . The structural congruence is the congruence on terms generated by fij-conversion and all instances of YM j M(YM): The evaluation relation P+n is defined between progra... |

209 | Games and full completeness for multiplicative linear logic
- Abramsky, Jagadeesan
- 1992
(Show Context)
Citation Context ...culus corresponds to minimal implicational logic, this result has some relevance for Proof Theory. An interesting contrast with the full completeness results proved for Multiplicative Linear Logic in =-=[AJ94] and a num-=-ber of other subsequent works is that various notions of "uniformity ", dinaturality etc. play an important role in those results, but do not arise here. Universality In [AJM96, HO96] a stro... |

197 | On full abstraction for PCF - Hyland, Ong |

192 | Full abstraction for pcf
- Abramsky, Jagadeesan, et al.
- 2000
(Show Context)
Citation Context ... with specific reference to PCF. We present axioms on models of PCF from which the key results on definability and full abstraction can be proved. It should be emphasized that not only the results of =-=[AJM96]-=-, but also the top-level structure of the actual proofs, are captured by our axiomatic account. In particular, our main axioms are abstracted from key lemmas in [AJM96]. The axioms mostly take the for... |

99 | What is a categorical model of intuitionistic linear logic
- Bierman
- 1995
(Show Context)
Citation Context ... (2) der y ; f = f: (3) There are moreover natural isomorphisms (the "exponential laws" ) e A;B : !(A \Theta B) = \Gamma! !A\Omega !B e 1 : !1s= \Gamma! 1 satisfying the coherence conditions=-= given in [Bie95]-=-. Every object !A has a cocommutative comonoid structure given by conA = !A !\Delta \Gamma! !(A \Theta A) e A;A \Gamma! !A\Omega !A weakA = !A !t A \Gamma! !1 e 1 \Gamma! 1: The co-Kleisli category K ... |

80 |
Categories for Types
- Crole
- 1993
(Show Context)
Citation Context ...n, n 2 N, and \Omega by ? f N? . The constant case k is interpreted by der f N? ; [f i j i 2 N] where f i = ( k ( i ); 0si ! k ?; isk: This interpretation is extended to all terms in the standard way =-=[Cro94]-=-. To accommodate recursion, we need another definition. Let K be a cartesian closed category. A fixpoint operator on K is a family of maps ( ) r A : K(A;A) \Gamma! K(1; A) satisfying f ffi f r = f r :... |

69 |
Algebraic Theories
- Manes
- 1974
(Show Context)
Citation Context ...95]. An affine category is a symmetric monoidal closed category C with finite products, such that the tensor unit is the terminal object 1, together with a comonad which we write in "co-Kleisli f=-=orm" [Man76]-=- as ( !; der; (\Delta) y ) where ! : C ! C, derA : !A ! A for all A, and (\Delta) y A;B : C( !A; B) ! C( !A; !B) satisfy: f y ; g y = (f y ; g) y (1) f y ; der = f (2) der y ; f = f: (3) There are mor... |

63 | Call-by-value games - Abramsky, McCusker - 1998 |

62 | Axiomatic Domain Theory in Categories of Partial Maps - Fiore - 1994 |

61 | Full abstraction for functional languages with control - Laird - 1997 |

59 | Game-theoretic analysis of call-by-value computation. Theor Comput Sci 221(1–2):393–456 - Honda, Yoshida - 1999 |

58 | Hereditarily sequential functionals - Nickau - 1994 |

54 |
Synthetic Differential Geometry
- Kock
- 2006
(Show Context)
Citation Context ...AJM96]. The axioms mostly take the form of assertions that some canonical map is an isomorphism, which is quite standard in categorical axiomatizations, for example of Synthetic Differential Geometry =-=[Koc81]-=-, distributive categories [Wal92], or dualizing objects [MOM91]. It is also noteworthy that, although our results apply to intuitionistic types, the axioms make essential use of the linear decompositi... |

53 | Full Abstraction for sequential languages: the state of the art - Berry, Curien, et al. - 1985 |

53 | First steps in synthetic domain theory - Hyland - 1991 |

48 |
Games and full abstraction for a functional metalanguage with recursive types
- McCusker
- 1996
(Show Context)
Citation Context ...comonad, g y ; derB = g: The content of (A3) is that (f ; derB ) y = f i.e. that the two passages are mutually inverse. This property was proved for categories of games in [AJM96] and subsequently in =-=[McC96a], under the name of -=-the "Bang Lemma". The idea is that morphisms f : !A ! !B must display uniform behaviour in all "threads", i.e. in each copy of B together with its associated copies of A. This prop... |

46 | Fully abstract models of typed -calculi - Milner - 1977 |

38 | Processes: A Mathematical Model of Computing Agents - Milner |

34 | Full abstraction for Idealized Algol with passive expressions - Abramsky, McCusker - 1999 |

34 | An Axiomatisation of Computationally Adequate Domain-Theoretic Models of FPC - Fiore, Plotkin - 1994 |

34 | Action Structures
- Milner
- 1992
(Show Context)
Citation Context ...xample [Fio96, Hyl91]. There has also been considerable progress in axiomatizing sufficient conditions for computational adequacy [FP94, Bra97, McC96a]. In another vein, the work on action structures =-=[MMP95]-=- can be seen as an axiomatics for process calculi and other computational formalisms. In the present paper we make the first contribution towards an axiomatic account of full abstraction, with specifi... |

30 |
Categories, Types and Structures
- Asperti, Longo
- 1091
(Show Context)
Citation Context ...eveloped in the present paper can be extended to yield this stronger result. We briefly sketch the necessary extensions. Firstly, we take our sequential categories to be enriched over enumerated sets =-=[AL91]-=- rather than just pointed sets. All the isomorphisms required in the axioms have then to be given effectively. This leads to an effective version of the Decomposition Theorem as in [AJM96]. The develo... |

28 | Full abstraction in the lazy -calculus - Abramsky, Ong - 1989 |

23 | Correspondence between operational and denotational semantics: the full abstraction problem for PCF. Handbook of logic in computer science (vol. 4): semantic modelling - Ong - 1995 |

19 | and full abstraction for FPC - McCusker, Games - 2000 |

15 | Linearity, sharing and state - Abramsky, McCusker - 1997 |

14 | Free bicomplete categories - Joyal - 1995 |

11 |
Categories and computer science
- Walters
- 1991
(Show Context)
Citation Context ...e form of assertions that some canonical map is an isomorphism, which is quite standard in categorical axiomatizations, for example of Synthetic Differential Geometry [Koc81], distributive categories =-=[Wal92]-=-, or dualizing objects [MOM91]. It is also noteworthy that, although our results apply to intuitionistic types, the axioms make essential use of the linear decompositions of these types [Gir87]. The p... |

5 | Free lattices, communication and money games - Joyal - 1997 |

4 | A simple adequate categorical model for PCF
- Brauner
- 1997
(Show Context)
Citation Context ...ntinuously observable then K ! (C) is a computationally adequate model of PCF. The original proof by Plotkin for the Scott continuous function model [Plo77] goes through in our axiomatic setting (cf. =-=[Bra97]-=-). In practice, it is often more convenient to verify somewhat stronger axioms. We say that a sequential category C is normed if: 10 ffl It is enriched over algebraic cpo's, with the ?-morphisms being... |

4 |
Games and abstract machines
- Danos, Herbelin, et al.
- 1996
(Show Context)
Citation Context ...s PCF is prototypical for higher-order programming languages, so is the pure simply typed -calculus for logical systems. (Definability results for game semantics of the pure calculus are discussed in =-=[DHR96]-=-, and were already known to the authors of [AJM96, HO96].) We shall indicate how our axiomatic approach can be modified (in fact: simplified) to deal with the pure calculus. We define a pure sequentia... |

4 |
Joyal Coherence Completions of Categories
- Hu, A
- 1999
(Show Context)
Citation Context ...t domains are discrete (any continuous function into a flat domain is either strict or constant); Coh, the category of coherence spaces and linear maps, is soft in the sense of [Joy95a, Joy95b]---see =-=[HJ97]. 2.4 Stan-=-dard datatypes Let C be a category with ?-maps as in Section 2.2. We assume given a class of objects of C which we will call "well-opened", which forms an exponential ideal, i.e. if B is wel... |

2 | Linear logic, -autonomous categories and cofree coalgebras - Seeley - 1987 |

1 |
Logical full abstraction and PCF. To appear in
- Longley, Plotkin
- 1996
(Show Context)
Citation Context ... strategies has all its elements definable. This is the strongest possible definability result, and is closely related to the notion of "Logical Full Abstraction" introduced by Longley and P=-=lotkin in [LP96]-=-, as shown loc. cit. The axiomatic methods developed in the present paper can be extended to yield this stronger result. We briefly sketch the necessary extensions. Firstly, we take our sequential cat... |

1 |
From Petri nets to linear logic via categories: a survey
- Marti-Oliet, Meseguer
- 1991
(Show Context)
Citation Context ... canonical map is an isomorphism, which is quite standard in categorical axiomatizations, for example of Synthetic Differential Geometry [Koc81], distributive categories [Wal92], or dualizing objects =-=[MOM91]-=-. It is also noteworthy that, although our results apply to intuitionistic types, the axioms make essential use of the linear decompositions of these types [Gir87]. The present paper is only a first s... |