The following pages link to Samson Abramsky (Q320191):
Displaying 50 items.
- Hardy is (almost) everywhere: nonlocality without inequalities for almost all entangled multipartite states (Q320194) (← links)
- Possibilities determine the combinatorial structure of probability polytopes (Q334459) (← links)
- Coalgebras, Chu spaces, and representations of physical systems (Q358691) (← links)
- Big toy models. Representing physical systems as Chu spaces (Q383003) (← links)
- Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- From IF to BI. A tale of dependence and separation (Q833040) (← links)
- Strictness analysis for higher-order functions (Q1082802) (← links)
- Mixed computation of Prolog programs (Q1108777) (← links)
- Domain theory in logical form (Q1174593) (← links)
- An internal language for autonomous categories (Q1320337) (← links)
- New foundations for the geometry of interaction (Q1327394) (← links)
- Proofs as processes (Q1342245) (← links)
- Full abstraction for idealized Algol with passive expressions (Q1575874) (← links)
- Game semantics for dependent types (Q1641014) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- Relating structure and power: comonadic semantics for computational resources (extended abstract) (Q1798780) (← links)
- Relational databases and Bell's theorem (Q1799295) (← links)
- Nuclear and trace ideals in tensored \(^*\)-categories (Q1818626) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Relational hidden variables and non-locality (Q1956376) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- Discrete density comonads and graph parameters (Q2104475) (← links)
- Events in context (Q2253172) (← links)
- Whither semantics? (Q2286732) (← links)
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference (Q2341698) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- Process realizability (Q2752053) (← links)
- (Q2753670) (← links)
- Game semantics for access control (Q2805155) (← links)
- Physical traces: quantum vs. classical information processing (Q2842812) (← links)
- Categorical quantum mechanics (Q2851800) (← links)
- Logic and categories as tools for building theories (Q2851822) (← links)
- Event domains, stable functions and proof-nets (Q2864146) (← links)
- From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference (Q2914673) (← links)
- \(H^\ast\)-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics (Q2918872) (← links)
- Introduction to Categories and Categorical Logic (Q3000919) (← links)
- A Cook's Tour of the Finitary Non-Well-Founded Sets (Q3007237) (← links)
- (Q3026333) (← links)
- From CSP to Game Semantics (Q3163396) (← links)
- Robin Milner's Work on Concurrency (Q3178242) (← links)
- Operational theories and Categorical quantum mechanics (Q3179084) (← links)
- (Q3325069) (← links)
- Abstract Interpretation, Logical Relations, and Kan Extensions (Q3348896) (← links)
- Games for Dependent Types (Q3449463) (← links)
- Petri Nets, Discrete Physics, and Distributed Quantum Computation (Q3507387) (← links)
- No-Cloning In Categorical Quantum Mechanics (Q3560836) (← links)
- (Q3574464) (← links)
