| Publication | Date of Publication | Type |
|---|
Profinite lambda-terms and parametricity
| 2026-04-02 | Paper |
Parsing as a lifting problem and the Chomsky-Schützenberger representation theorem
| 2026-04-02 | Paper |
Template games and differential linear logic
| 2024-12-19 | Paper |
A functorial excursion between algebraic geometry and linear logic
| 2024-12-06 | Paper |
Convolution products on double categories and categorification of rule algebras
| 2024-10-21 | Paper |
Parsing as a lifting problem and the Chomsky-Sch\"utzenberger representation theorem
| 2022-12-18 | Paper |
A game semantics of concurrent separation logic
| 2022-04-25 | Paper |
On dialogue games and graph games
| 2022-04-25 | Paper |
Concurrent Separation Logic Meets Template Games
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
An asynchronous soundness theorem for concurrent separation logic
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Ribbon tensorial logic
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Higher-order parity automata
| 2021-01-19 | Paper |
On bifibrations of model categories
Advances in Mathematics | 2020-06-15 | Paper |
An explicit formula for the free exponential modality of linear logic
Mathematical Structures in Computer Science | 2018-08-07 | Paper |
Categorical combinatorics for non deterministic strategies on simple games
| 2018-07-17 | Paper |
An Isbell duality theorem for type refinement systems
Mathematical Structures in Computer Science | 2018-05-17 | Paper |
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
A Fibrational Account of Local States
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Relational semantics of linear logic and higher-order model checking
| 2017-08-31 | Paper |
The parametric continuation monad
Mathematical Structures in Computer Science | 2017-06-14 | Paper |
Game Semantics in String Diagrams
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
On dialogue games and coherent strategies
| 2017-02-02 | Paper |
Dialogue categories and chiralities
Publications of the Research Institute for Mathematical Sciences, Kyoto University | 2016-12-30 | Paper |
Functors are type refinement systems
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
An algebraic account of references in game semantics
Electronic Notes in Theoretical Computer Science | 2016-05-10 | Paper |
Semantic types: a fresh look at the ideal model for types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-11-11 | Paper |
An Infinitary Model of Linear Logic
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Finitary semantics of linear logic and higher-order model-checking
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
A very modal model of a modern, major, general type system
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
Local states in string diagrams
Lecture Notes in Computer Science | 2014-07-24 | Paper |
Type refinement and monoidal closed bifibrations
| 2013-10-01 | Paper |
Dialogue categories and Frobenius monoids
Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky | 2013-05-28 | Paper |
Resource modalities in tensor logic
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Categorical semantics of linear logic
| 2011-02-15 | Paper |
Interactive models of computation and program behavior
| 2010-05-27 | Paper |
An Explicit Formula for the Free Exponential Modality of Linear Logic
Automata, Languages and Programming | 2009-07-14 | Paper |
Functorial Boxes in String Diagrams
Computer Science Logic | 2009-03-12 | Paper |
Asynchronous Games: Innocence Without Alternation
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Asynchronous games. II: The true concurrency of innocence
Theoretical Computer Science | 2006-09-13 | Paper |
Sequential algorithms and strongly stable functions
Theoretical Computer Science | 2005-10-26 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
scientific article; zbMATH DE number 2185670 (Why is no real title available?)
| 2005-07-04 | Paper |
scientific article; zbMATH DE number 2134917 (Why is no real title available?)
| 2005-02-18 | Paper |
Comparing hierarchies of types in models of linear logic
Information and Computation | 2004-10-04 | Paper |
scientific article; zbMATH DE number 2090063 (Why is no real title available?)
| 2004-08-12 | Paper |
Double categories: a modular model of multiplicative linear logic
Mathematical Structures in Computer Science | 2003-10-28 | Paper |
Axiomatic rewriting theory II: the -calculus enjoys finite normalisation cones
Journal Of Logic And Computation | 2001-10-30 | Paper |
scientific article; zbMATH DE number 1392283 (Why is no real title available?)
| 2000-01-24 | Paper |
scientific article; zbMATH DE number 1301737 (Why is no real title available?)
| 1999-12-13 | Paper |
scientific article; zbMATH DE number 1223728 (Why is no real title available?)
| 1999-09-21 | Paper |
scientific article; zbMATH DE number 1086659 (Why is no real title available?)
| 1997-11-13 | Paper |
scientific article; zbMATH DE number 1086711 (Why is no real title available?)
| 1997-01-01 | Paper |
