activity
20172024
most citedRewriting Context-free Families of String Diagrams

1 citations · 2 across the 2 of their papers we have counts for

collaborators

9 papers

math.CT20241 cited

The Category of Operator Spaces and Complete Contractions

Bert Lindenhovius, Vladimir Zamdzhiev

We show that the category OS of operator spaces, with complete contractions as morphisms, is locally countably presentable. This result, together with its symmetric monoidal closed…

cs.LO2021

Commutative Monads for Probabilistic Programming Languages

Xiaodong Jia, Bert Lindenhovius, Michael Mislove +1

A long-standing open problem in the semantics of programming languages supporting probabilistic choice is to find a commutative monad for probability on the category DCPO. In this…

cs.LO2020

Computational Adequacy for Substructural Lambda Calculi

Vladimir Zamdzhiev

Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many…

cs.LO2020

Semantics for first-order affine inductive data types via slice categories

Vladimir Zamdzhiev

Affine type systems are substructural type systems where copying of information is restricted, but discarding of information is permissible at all types. Such type systems are well…

cs.LO2019

Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory

Romain Péchoux, Simon Perdrix, Mathys Rennela +1

Inductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive dat…

cs.LO2019

Reflecting Algebraically Compact Functors

Vladimir Zamdzhiev

A compact T-algebra is an initial T-algebra whose inverse is a final T-coalgebra. Functors with this property are said to be algebraically compact. This is a very strong property u…