Get started
Author

Shin-ya Katsumata

Observed names: Katsumata Shin-ya, Katsumata, Shin-Ya, Katsumata, Shin-ya, S. Katsumata, SHIN-YA KATSUMATA, Shin-Ya Katsumata, 審也 勝股
Observed institutions: Kyoto Sangyo University, National Institute of Informatics, Kyoto University, University of Cambridge, Research Institute for Mathematical Sciences, Kyoto University, University of Edinburgh
ORCID: 0000-0001-7529-5489
Observed ORCID: 0000-0001-7529-5489
OpenAlex ID: A5041431787
Parametric effect monads and semantics of effect systems
2014 · Shin-ya Katsumata · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 131
Combining effects and coeffects via grading
2016 · Marco Gaboardi, Shin-ya Katsumata, et al. · ACM SIGPLAN International Conference on Functional Programming (ICFP) · 100
Parametric effect monads and semantics of effect systems
2014 · Shin-ya Katsumata · ACM SIGPLAN Notices · 59
Towards a Formal Theory of Graded Monads
2016 · Soichiro Fujii, Shin-ya Katsumata, et al. · Lecture notes in computer science · 56
A semantic account of metric preservation
2016 · Arthur Azevedo de Amorim, Marco Gaboardi, et al. · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 52
PDF
A Semantic Formulation of ⊤ ⊤-Lifting and Logical Predicates for Computational Metalanguage
2005 · Shin-ya Katsumata · Lecture notes in computer science · 42
Probabilistic Relational Reasoning via Metrics
2019 · Arthur Azevedo de Amorim, Marco Gaboardi, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 32
PDF
Relating computational effects by ⊤⊤-lifting
2012 · Shin-ya Katsumata · Information and Computation · 30
PDF
Codensity Games for Bisimilarity
2019 · Yuichi Komorida, Shin-ya Katsumata, et al. · New Generation Computing · 27
PDF
Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy
2019 · Tetsuya Sato, Gilles Barthe, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 27
PDF
Differentiable Causal Computations via Delayed Trace
2019 · David Sprunger, Shin-ya Katsumata · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 24
PDF
Proof-Directed De-compilation of Low-Level Code
2001 · Shin-ya Katsumata, Atsushi Ohori · Lecture notes in computer science · 22
Codensity Lifting of Monads and its Dual
2018 · Shin-ya Katsumata, Tetsuya Sato, et al. · Logical Methods in Computer Science · 21
PDF
A Double Category Theoretic Analysis of Graded Linear Exponential Comonads
2018 · Shin-ya Katsumata · Lecture notes in computer science · 21
PDF
Interaction Laws of Monads and Comonads
2020 · Shin-ya Katsumata, Exequiel Rivas, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 19
PDF
Combining effects and coeffects via grading
2016 · Marco Gaboardi, Shin-ya Katsumata, et al. · ACM SIGPLAN Notices · 19
Higher-order probabilistic adversarial computations: categorical semantics and program logics
2021 · Alejandro Aguirre, Gilles Barthe, et al. · Proceedings of the ACM on Programming Languages · 18
PDF
Graded Hoare Logic and its Categorical Semantics
2021 · Tetsuya Sato, Dominic Orchard, et al. · Lecture notes in computer science · 18
PDF
Preorders on Monads and Coalgebraic Simulations
2013 · Shin-ya Katsumata, Tetsuya Sato · Lecture notes in computer science · 18
PDF
Flexible presentations of graded monads
2022 · Shin-ya Katsumata, Dylan McDermott, et al. · Proceedings of the ACM on Programming Languages · 17
PDF
Weakest Preconditions in Fibrations
2020 · Alejandro Aguirre, Shin-ya Katsumata · Electronic Notes in Theoretical Computer Science · 17
PDF
Weakest preconditions in fibrations
2022 · Alejandro Aguirre, Shin-ya Katsumata, et al. · Mathematical Structures in Computer Science · 16
Codensity Liftings of Monads
2015 · Katsumata, Shin-ya, Sato, Tetsuya · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 16
PDF
Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation
2021 · Yuichi Komorida, Shin-ya Katsumata, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 14
PDF
Path Category for Free: Open Morphisms from Coalgebras with Non-deterministic Branching
2019 · Thorsten Wißmann, Jérémy Dubut, et al. · Lecture notes in computer science · 14
PDF
Works count: 76
Citation count: 999
H-index: 18
I10-index: 29
Year
Topic
Type