28 citations · 37 across the 12 of their papers we have counts for
13 papers
Granthi: Higher-Order Quantum Programming via Unitary Wiring
Samson Abramsky, Radha Jagadeesan
Many mainstream quantum programming languages confine higher-order structure to a classical host while restricting the quantum layer to first-order operations on qubits. This paper…
Essential Unitarity for Higher-Order Quantum Computation
Samson Abramsky, Radha Jagadeesan
We develop a boundary-centric semantic framework for higher-order quantum computation, building on the Kelly-Laplaza description of compact closure and Abramsky's execution account…
Game Semantics for Higher-Order Unitary Quantum Computation
Samson Abramsky, Radha Jagadeesan
We develop a symmetric monoidal closed category of games, incorporating sums and products, to model quantum computation at higher types. This model is expressive, capable of repres…
(Towards a) Statistical Probabilistic Lazy Lambda Calculus
Radha Jagadeesan
We study the desiderata on a model for statistical probabilistic programming languages. We argue that they can be met by a combination of traditional tools, namely open bisimulatio…
Games for Dependent Types
Samson Abramsky, Radha Jagadeesan, Matthijs Vákár
We present a model of dependent type theory (DTT) with Pi-, 1-, Sigma- and intensional Id-types, which is based on a slight variation of the category of AJM-games and history-free…
Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency
Radha Jagadeesan, James Riely
Linearizability is the de facto correctness criterion for concurrent data structures. Unfortunately, linearizability imposes a performance penalty which scales linearly in the numb…
Game Semantics for Access Control
Samson Abramsky, Radha jagadeesan
We introduce a semantic approach to the study of logics for access control and dependency analysis, based on Game Semantics. We use a variant of AJM games with explicit justificati…
A Game Semantics for Generic Polymorphism
Samson Abramsky, Radha Jagadeesan
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe the…
Games and Full Completeness for Multiplicative Linear Logic
Samson Abramsky, Radha Jagadeesan
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 L…
Full Abstraction for PCF
Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
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 mod…
TCC, with History
Vijay Saraswat, Radha Jagadeesan, Vineet Gupta
Modern computer systems are awash in a sea of asynchronous events. There is an increasing need for a declarative language that can permit business users to specify complex event-pr…
Lambda-RBAC: Programming with Role-Based Access Control
Radha Jagadeesan, Alan Jeffrey, Corin Pitcher +1
We study mechanisms that permit program components to express role constraints on clients, focusing on programmatic security mechanisms, which permit access controls to be expresse…
Approximate reasoning for real-time probabilistic processes
Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisim…