4 Search Results for "Cho, Kenta"

Document
DOI: 10.4230/LIPIcs.STACS.2026.65
Demystifying Codensity Monads via Duality

Authors: Fabian Lenke, Nico Wittrock, Stefan Milius, and Henning Urbat

Published in: LIPIcs, Volume 364, 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026)

Abstract
Codensity monads provide a universal method to generate complex monads from simple functors. Recently, a wide range of important monads in logic, denotational semantics, and probabilistic computation, such as several incarnations of the ultrafilter monad, the Vietoris monad, and the Giry monad, have been presented as codensity monads, using complex arguments. We propose a unifying categorical approach to codensity presentations of monads, based on the idea of relating the presenting functor to a dense functor via a suitable duality between categories. We prove a general presentation result applying to every such situation and demonstrate that most codensity presentations known in the literature emerge from this strikingly simple duality-based setup, drastically alleviating the complexity of their proofs and in many cases completely reducing them to standard duality results. Additionally, we derive a number of novel codensity presentations using our framework, including the first non-trivial codensity presentations for the filter monads on sets and topological spaces, the lower Vietoris monad on topological spaces, and the expectation monad on sets.
Cite as

Fabian Lenke, Nico Wittrock, Stefan Milius, and Henning Urbat. Demystifying Codensity Monads via Duality. In 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 364, pp. 65:1-65:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{lenke_et_al:LIPIcs.STACS.2026.65,
  author =	{Lenke, Fabian and Wittrock, Nico and Milius, Stefan and Urbat, Henning},
  title =	{{Demystifying Codensity Monads via Duality}},
  booktitle =	{43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026)},
  pages =	{65:1--65:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-412-3},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{364},
  editor =	{Mahajan, Meena and Manea, Florin and McIver, Annabelle and Thắng, Nguy\~{ê}n Kim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.65},
  URN =		{urn:nbn:de:0030-drops-255549},
  doi =		{10.4230/LIPIcs.STACS.2026.65},
  annote =	{Keywords: Codensity, Monad, Duality}
}
Document
Invited Talk
DOI: 10.4230/LIPIcs.CALCO.2025.1
Effectful Mealy Machines: Coalgebraic and Causal Traces (Invited Talk)

Authors: Filippo Bonchi, Elena Di Lavore, and Mario Román

Published in: LIPIcs, Volume 342, 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)

Abstract
We introduce effectful Mealy machines - a general notion of Mealy machine with global effects - and give them semantics in terms of both bisimilarity and traces. Bisimilarity of effectful Mealy machines is characterized syntactically, via free uniform feedback. Their traces are given a novel semantic coinductive universe in terms of effectful streams. We prove that this framework generalizes standard causal processes and captures existing flavours of Mealy machine, bisimilarity, and trace. This is an extended abstract for the manuscript Effectful Mealy Machines: Bisimulation and Trace that will appear in the proceedings of LiCS 2025 [Bonchi et al., 2025]; an extended version with proofs is also available (arxiv.org/abs/2410.10627) [Bonchi et al., 2025]. We additionally characterise causal processes as lax-natural transformations.
Cite as

Filippo Bonchi, Elena Di Lavore, and Mario Román. Effectful Mealy Machines: Coalgebraic and Causal Traces (Invited Talk). In 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 342, pp. 1:1-1:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{bonchi_et_al:LIPIcs.CALCO.2025.1,
  author =	{Bonchi, Filippo and Di Lavore, Elena and Rom\'{a}n, Mario},
  title =	{{Effectful Mealy Machines: Coalgebraic and Causal Traces}},
  booktitle =	{11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)},
  pages =	{1:1--1:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-383-6},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{342},
  editor =	{C\^{i}rstea, Corina and Knapp, Alexander},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2025.1},
  URN =		{urn:nbn:de:0030-drops-235596},
  doi =		{10.4230/LIPIcs.CALCO.2025.1},
  annote =	{Keywords: Mealy machines, coinduction, copy-discard categories, premonoidal categories}
}
Document
DOI: 10.4230/LIPIcs.CSL.2025.44
Classical Linear Logic in Perfect Banach Lattices

Authors: Pedro H. Azevedo de Amorim, Leon Witzman, and Dexter Kozen

Published in: LIPIcs, Volume 326, 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025)

Abstract
In recent years, researchers have proposed various models of linear logic with strong connections to measure theory, with probabilistic coherence spaces (PCoh) being one of the most prominent. One of the main limitations of the PCoh model is that it cannot interpret continuous measures. To overcome this obstacle, Ehrhard has extended PCoh to a category of positive cones and linear Scott-continuous functions and shown that it is a model of intuitionistic linear logic. In this work we show that the category PBanLat₁ of perfect Banach lattices and positive linear functions of norm at most 1 can serve the same purpose, with some added benefits. We show that PBanLat₁ is a model of classical linear logic (without exponential) and that PCoh embeds fully and faithfully in PBanLat₁ while preserving the monoidal and *-autonomous structures. Finally, we show how PBanLat₁ can be used to give semantics to a higher-order probabilistic programming language.
Cite as

Pedro H. Azevedo de Amorim, Leon Witzman, and Dexter Kozen. Classical Linear Logic in Perfect Banach Lattices. In 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 326, pp. 44:1-44:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{azevedodeamorim_et_al:LIPIcs.CSL.2025.44,
  author =	{Azevedo de Amorim, Pedro H. and Witzman, Leon and Kozen, Dexter},
  title =	{{Classical Linear Logic in Perfect Banach Lattices}},
  booktitle =	{33rd EACSL Annual Conference on Computer Science Logic (CSL 2025)},
  pages =	{44:1--44:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-362-1},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{326},
  editor =	{Endrullis, J\"{o}rg and Schmitz, Sylvain},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.44},
  URN =		{urn:nbn:de:0030-drops-228013},
  doi =		{10.4230/LIPIcs.CSL.2025.44},
  annote =	{Keywords: Probabilistic Semantics, Linear Logic, Categorical Semantics}
}
Document
DOI: 10.4230/LIPIcs.CALCO.2017.25
The EfProb Library for Probabilistic Calculations

Authors: Kenta Cho and Bart Jacobs

Published in: LIPIcs, Volume 72, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)

Abstract
EfProb is an abbreviation of Effectus Probability. It is the name of a library for probability calculations in Python. EfProb offers a uniform language for discrete, continuous and quantum probability. For each of these three cases, the basic ingredients of the language are states, predicates, and channels. Probabilities are typically calculated as validities of predicates in states. States can be updated (conditioned) with predicates. Channels can be used for state transformation and for predicate transformation. This short paper gives an overview of the use of EfProb.
Cite as

Kenta Cho and Bart Jacobs. The EfProb Library for Probabilistic Calculations. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 25:1-25:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{cho_et_al:LIPIcs.CALCO.2017.25,
  author =	{Cho, Kenta and Jacobs, Bart},
  title =	{{The EfProb Library for Probabilistic Calculations}},
  booktitle =	{7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)},
  pages =	{25:1--25:8},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-033-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{72},
  editor =	{Bonchi, Filippo and K\"{o}nig, Barbara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.25},
  URN =		{urn:nbn:de:0030-drops-80529},
  doi =		{10.4230/LIPIcs.CALCO.2017.25},
  annote =	{Keywords: probability, embedded language, effectus theory}
}
  • Refine by Type
  • 4 Document/PDF
  • 3 Document/HTML

  • Refine by Publication Year
  • 1 2026
  • 2 2025
  • 1 2017

  • Refine by Author
  • 1 Azevedo de Amorim, Pedro H.
  • 1 Bonchi, Filippo
  • 1 Cho, Kenta
  • 1 Di Lavore, Elena
  • 1 Jacobs, Bart
  • Show More...

  • Refine by Series/Journal
  • 4 LIPIcs

  • Refine by Classification
  • 2 Theory of computation → Categorical semantics
  • 1 Theory of computation → Abstract machines
  • 1 Theory of computation → Denotational semantics
  • 1 Theory of computation → Linear logic
  • 1 Theory of computation → Models of computation
  • Show More...

  • Refine by Keyword
  • 1 Categorical Semantics
  • 1 Codensity
  • 1 Duality
  • 1 Linear Logic
  • 1 Mealy machines
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact