From post

Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics.

, и . CALCO, том 72 из LIPIcs, стр. 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Fully-abstract concurrent games for pi., , и . CoRR, (2013)Cartesian closed 2-categories and permutation equivalence in higher-order rewriting.. Log. Methods Comput. Sci., (2013)Template Games, Simple Games, and Day Convolution., , и . FSCD, том 131 из LIPIcs, стр. 16:1-16:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Intensionally Fully-abstract Sheaf Model for pi., , и . CALCO, том 35 из LIPIcs, стр. 86-100. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Rigid Mixin Modules.. FLOPS, том 2998 из Lecture Notes in Computer Science, стр. 214-228. Springer, (2004)What's in a game?: A theory of game models., и . LICS, стр. 374-383. ACM, (2018)Full Abstraction for Fair Testing in CCS.. CALCO, том 8089 из Lecture Notes in Computer Science, стр. 175-190. Springer, (2013)Modules over monads and operational semantics (expanded version)., , и . Log. Methods Comput. Sci., (2022)A categorical framework for congruence of applicative bisimilarity in higher-order languages., и . Log. Methods Comput. Sci., (2022)A Cellular Howe Theorem., , и . LICS, стр. 273-286. ACM, (2020)