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

@inproceedings{Zamdzhiev2020SemanticsFF,
  title={Semantics for first-order affine inductive data types via slice categories},
  author={Vladimir Zamdzhiev},
  booktitle={CMCS},
  year={2020}
}
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-suited for describing quantum programming languages, because copying of quantum information violates the laws of quantum mechanics. In this paper, we consider a first-order affine type system with inductive data types and present a novel categorical semantics for it. The most challenging aspect of this interpretation… 
1 Citations

Figures from this paper

Reflecting Algebraically Compact Functors
TLDR
This paper provides a constructive description of a large class of algebraically compact functors (satisfying a compositionality principle) and shows how the methods compare quite favorably to other approaches from the literature.

References

SHOWING 1-10 OF 31 REFERENCES
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory
TLDR
This paper constructs a sound categorical model for the quantum programming language QPL and provides the first detailed semantic treatment of user-defined inductive datatypes in quantum programming, and shows the denotational interpretation is invariant with respect to big-step reduction.
Mixed linear and non-linear recursive types
TLDR
A type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus) and a new technique for solving recursive domain equations within the category CPO by constructing the solutions over pre-embeddings is described.
The category-theoretic solution of recursive domain equations
  • M. Smyth, G. Plotkin
  • Mathematics
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
The purpose of the present paper is to set up a categorical framework in which the known techniques for solving equations find a natural place, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega $-categories.
LNL-FPC: The Linear/Non-linear Fixpoint Calculus
TLDR
A type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus) and a new technique for solving recursive domain equations within cartesian categories by constructing the solutions over pre-embeddings is described.
Quantum Programming with Inductive Datatypes
TLDR
This paper constructs a sound categorical model for the quantum programming language QPL and provides the first detailed semantic treatment of user-defined inductive datatypes in quantum programming, and shows the denotational interpretation is invariant with respect to big-step reduction.
A categorical model for a quantum circuit description language
TLDR
This paper formalizes a small, but useful fragment of Quipper called Proto-Quipper-M, which is type-safe and has a formal denotational and operational semantics, and defines the programming language to fit the model.
Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams
TLDR
This work presents an adequacy result for the diagram-free fragment of the language which corresponds to a modified version of Benton and Wadler's adjoint calculus with recursion, and extends the language with general recursion and proves soundness.
Game semantics for quantum programming
TLDR
This paper introduces a model of quantum games and strategies, combining quantum data with a representation of the dynamics of computation inspired from causal models of concurrent systems, and interprets and proves adequacy for the full quantum lambda-calculus.
Quantum lambda calculus
TLDR
This chapter discusses how to combine higher-order functions with quantum computation, and investigates the interplay between classical objects and quantum objects in a higherorder context.
Applying quantitative semantics to higher-order quantum computing
TLDR
This paper proposes a denotational semantics for a quantum lambda calculus with recursion and an infinite data type, using constructions from quantitative semantics of linear logic.
...
1
2
3
4
...