@inproceedings{10.1145/3209108.3209157,
    Abstract = {Motivated by a tight connection between Joyal's combinatorial species and quantitative models of linear logic, this paper introduces weighted generalised species (or weighted profunctors), where weights are morphisms of a given symmetric monoidal closed category (SMCC). For each SMCC W, we show that the category of W-weighted profunctors is a Lafont category, a categorical model of linear logic with exponential. As a model of programming languages, the construction of this paper gives a unified framework that induces adequate models of nondeterministic, probabilistic, algebraic and quantum programming languages by an appropriate choice of the weight SMCC.},
    Address = {New York, NY, USA},
    Author = {Tsukada, Takeshi and Asada, Kazuyuki and Ong, C.-H. Luke},
    BookTitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science},
    File = {Species, Profunctors and Taylor Expansion Weighted by SMCC - main - a.pdf},
    ISBN = {9781450355834},
    Keywords = {rigid resource calculus, weighted species, quantitative model, quantum computation, generalised species},
    Location = {Oxford, United Kingdom},
    Pages = {889--898},
    Publisher = {Association for Computing Machinery},
    Series = {LICS '18},
    Title = {Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs},
    URL = {https://doi.org/10.1145/3209108.3209157},
    Year = {2018},
    bdsk-url-1 = {https://doi.org/10.1145/3209108.3209157},
    date-added = {2023-03-10 22:59:00 +0100},
    date-modified = {2023-03-10 22:59:00 +0100},
    numpages = {10},
    doi = {10.1145/3209108.3209157}
}

@inproceedings{10.1145/3209108.3209157, Abstract = {Motivated by a tight connection between Joyal's combinatorial species and quantitative models of linear logic, this paper introduces weighted generalised species (or weighted profunctors), where weights are morphisms of a given symmetric monoidal closed category (SMCC). For each SMCC W, we show that the category of W-weighted profunctors is a Lafont category, a categorical model of linear logic with exponential. As a model of programming languages, the construction of this paper gives a unified framework that induces adequate models of nondeterministic, probabilistic, algebraic and quantum programming languages by an appropriate choice of the weight SMCC.}, Address = {New York, NY, USA}, Author = {Tsukada, Takeshi and Asada, Kazuyuki and Ong, C.-H. Luke}, BookTitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science}, File = {Species, Profunctors and Taylor Expansion Weighted by SMCC - main - a.pdf}, ISBN = {9781450355834}, Keywords = {rigid resource calculus, weighted species, quantitative model, quantum computation, generalised species}, Location = {Oxford, United Kingdom}, Pages = {889--898}, Publisher = {Association for Computing Machinery}, Series = {LICS '18}, Title = {Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs}, URL = {https://doi.org/10.1145/3209108.3209157}, Year = {2018}, bdsk-url-1 = {https://doi.org/10.1145/3209108.3209157}, date-added = {2023-03-10 22:59:00 +0100}, date-modified = {2023-03-10 22:59:00 +0100}, numpages = {10}, doi = {10.1145/3209108.3209157} }