activity
20052026
most citedApproximate reasoning for real-time probabilistic processes

28 citations · 37 across the 13 of their papers we have counts for

collaborators
Showing cs.LOShow all

8 papers · 1 filter

cs.LO2026

Essential Unitarity for Higher-Order Quantum Computation (Extended Abstract)

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…

cs.LO2024

(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…

cs.LO2015★ 1 cited

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…

cs.LO2014

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…

cs.LO2013

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…

cs.LO2013

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…

cs.LO2013

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…

cs.LO2005★ 28 cited

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…