#### Filter Results:

- Full text PDF available (119)

#### Publication Year

1971

2017

- This year (7)
- Last 5 years (41)
- Last 10 years (73)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Samson Abramsky
- LICS
- 1987

A metalanguage for denotational semantics is given a logical interpretation: types are interpreted as propositional theories; terms (in an extended typed λ-calculus, denoting elements of types) are embedded in an endogenous program logic, which characterises their behaviour in terms of which properties they satisfy; terms (in an extension of the algebraic… (More)

- Samson Abramsky, Bob Coecke
- Proceedings of the 19th Annual IEEE Symposium on…
- 2004

Particular focus in this paper is on quantum information protocols, which exploit quantum-mechanical effects in an essential way. The particular examples we shall use to illustrate our approach will be teleportation (Benett et al., 1993), logic-gate teleportation (Gottesman and Chuang,1999), and entanglement swapping (Zukowski et al., 1993). The ideas… (More)

- Samson Abramsky
- 1990

- Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- Inf. Comput.
- 1994

An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain “history-free” strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable in a certain simple extension of PCF. We then introduce an intrinsic… (More)

- Samson Abramsky
- Theor. Comput. Sci.
- 1993

We study Girard's Linear Logic from the point of view of giving a concrete computational interpretation of the logic, based on the Curry-Howard isomorphism. In the case of Intuitionistic Linear Logic, this leads to a reenement of the lambda calculus, giving ner control over order of evaluation and storage allocation, while maintaining the logical content of… (More)

- Samson Abramsky, Radha Jagadeesan
- J. Symb. Log.
- 1992

We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played… (More)

- Samson Abramsky
- Inf. Comput.
- 1991

- Samson Abramsky, C.-H. Luke Ong
- Inf. Comput.
- 1993

- Samson Abramsky, Kohei Honda, Guy McCusker
- LICS
- 1998

A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of… (More)

- Samson Abramsky, Guy McCusker
- Electr. Notes Theor. Comput. Sci.
- 1996

The manipulation of objects with state which changes over time is all-pervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focusses on \Idealized Algol", an elegant synthesis of imperative… (More)