Vladimir Zamdzhiev

Orcid: 0000-0002-9061-3921

Affiliations:
  • LORIA, Nancy, France
  • University of Oxford, UK (former)


According to our database1, Vladimir Zamdzhiev authored at least 23 papers between 2014 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Type-safe Quantum Programming in Idris.
Proceedings of the Programming Languages and Systems, 2023

2022
Semantics for variational Quantum programming.
Proc. ACM Program. Lang., 2022

Central Submonads and Notions of Computation.
CoRR, 2022

Quantum Expectation Transformers for Cost Analysis.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
LNL-FPC: The Linear/Non-linear Fixpoint Calculus.
Log. Methods Comput. Sci., 2021

The Central Valuations Monad.
CoRR, 2021

Qimaera: Type-safe (Variational) Quantum Programming in Idris.
CoRR, 2021

Commutative Monads for Probabilistic Programming Languages.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

The Central Valuations Monad (Early Ideas).
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Computational Adequacy for Substructural Lambda Calculi.
Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Semantics for First-Order Affine Inductive Data Types via Slice Categories.
Proceedings of the Coalgebraic Methods in Computer Science, 2020

2019
Mixed linear and non-linear recursive types.
Proc. ACM Program. Lang., 2019

Reflecting Algebraically Compact Functors.
Proceedings of the Proceedings Applied Category Theory 2019, 2019

2018
A Framework for Rewriting Families of String Diagrams.
Proceedings of the Proceedings Tenth International Workshop on Computing with Terms and Graphs, 2018

Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Rewriting Context-free Families of String Diagrams.
CoRR, 2017

2016
Rewriting context-free families of string diagrams.
PhD thesis, 2016

2015
!-graphs with trivial overlap are context-free.
Proceedings of the Proceedings Graphs as Models, 2015

Equational Reasoning with Context-Free Families of String Diagrams.
Proceedings of the Graph Transformation - 8th International Conference, 2015

Quantomatic: A Proof Assistant for Diagrammatic Reasoning.
Proceedings of the Automated Deduction - CADE-25, 2015

2014
The ZX calculus is incomplete for quantum mechanics.
Proceedings of the 11th workshop on Quantum Physics and Logic, 2014


  Loading...