Paul-André Melliès

Guillaume Munch-Maccagnoni

CoRR, February, 2025

The categorical contours of the Chomsky-Sch\"utzenberger representation theorem.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2025

2024

The categorical contours of the Chomsky-Schützenberger representation theorem.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Profinite lambda-terms and parametricity.

[BibT_eX]

[DOI]

Sam van Gool

Vincent Moreau

Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

Convolution Products on Double Categories and Categorification of Rule Algebras.

[BibT_eX]

[DOI]

Nicolas Behr

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022

Layered and object-based game semantics.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

Parsing as a lifting problem and the Chomsky-Schützenberger representation theorem.

[BibT_eX]

[DOI]

Proceedings of the 38th Conference on the Mathematical Foundations of Programming Semantics, 2022

A Functorial Excursion Between Algebraic Geometry and Linear Logic.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

Asynchronous Template Games and the Gray Tensor Product of 2-Categories.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Concurrent Separation Logic Meets Template Games.

[BibT_eX]

[DOI]

Léo Stefanesco

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Comprehension and Quotient Structures in the Language of 2-Categories.

[BibT_eX]

[DOI]

Nicolas Rolland

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019

Categorical combinatorics of scheduling and synchronization in game semantics.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2019

Template games and differential linear logic.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

An Isbell duality theorem for type refinement systems.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

A Game Semantics of Concurrent Separation Logic.

[BibT_eX]

[DOI]

Léo Stefanesco

Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

On Dialogue Games and Graph Games.

[BibT_eX]

[DOI]

Clément Jacq

Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

An Asynchronous Soundness Theorem for Concurrent Separation Logic.

[BibT_eX]

[DOI]

Léo Stefanesco

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Ribbon Tensorial Logic.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Categorical Combinatorics for Non Deterministic Strategies on Simple Games.

[BibT_eX]

[DOI]

Clément Jacq

Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017

The parametric continuation monad.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

On bifibrations of model categories.

[BibT_eX]

[DOI]

Pierre Cagne

CoRR, 2017

A micrological study of negation.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2017

Higher-order parity automata.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Five Basic Concepts of Axiomatic Rewriting Theory.

[BibT_eX]

[DOI]

CoRR, 2016

A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Towards a Formal Theory of Graded Monads.

[BibT_eX]

[DOI]

Soichiro Fujii

Shin-ya Katsumata

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

Isbell Duality for Refinement Types.

[BibT_eX]

[DOI]

CoRR, 2015

Tensorial logic with colours and higher-order model checking.

[BibT_eX]

[DOI]

CoRR, 2015

Functors are Type Refinement Systems.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Finitary Semantics of Linear Logic and Higher-Order Model-Checking.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

A Fibrational Account of Local States.

[BibT_eX]

[DOI]

Kenji Maillard

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

An Infinitary Model of Linear Logic.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2015

Relational Semantics of Linear Logic and Higher-order Model Checking.

[BibT_eX]

[DOI]

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Indexed linear logic and higher-order model checking.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventh Workshop on Intersection Types and Related Systems, 2014

Local States in String Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013

Type refinement and monoidal closed bifibrations.

[BibT_eX]

[DOI]

CoRR, 2013

On dialogue games and coherent strategies.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Dialogue Categories and Frobenius Monoids.

[BibT_eX]

[DOI]

Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012

Game Semantics in String Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2010

Resource modalities in tensor logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2010

Segal Condition Meets Computational Effects.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

10252 Executive Summary - Game Semantics and Program Verification.

[BibT_eX]

[DOI]

Proceedings of the Game Semantics and Program Verification, 20.06. - 25.06.2010, 2010

10252 Abstracts Collection - Game Semantics and Program Verification.

[BibT_eX]

[DOI]

Proceedings of the Game Semantics and Program Verification, 20.06. - 25.06.2010, 2010

2009

An Algebraic Account of References in Game Semantics.

[BibT_eX]

[DOI]

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

An Explicit Formula for the Free Exponential Modality of Linear Logic.

[BibT_eX]

[DOI]

Christine Tasson

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2007

A very modal model of a modern, major, general type system.

[BibT_eX]

[DOI]

Andrew W. Appel

Christopher D. Richards

Jérôme Vouillon

Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2007

Resource modalities in game semantics.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Categorical Combinatorics for Innocent Strategies.

[BibT_eX]

[DOI]

Russell Harmer

Martin Hyland

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Asynchronous Games: Innocence Without Alternation.

[BibT_eX]

[DOI]

Samuel Mimram

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006

Functorial Boxes in String Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

Sequential algorithms and strongly stable functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Recursive Polymorphic Types and Parametricity in an Operational Framework.

[BibT_eX]

[DOI]

Jerome Vouillon

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem.

[BibT_eX]

[DOI]

Proceedings of the Processes, 2005

2004

Comparing hierarchies of types in models of linear logic.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Asynchronous Games 3 An Innocent Model of Linear Logic.

[BibT_eX]

[DOI]

Proceedings of the 10th Conference on Category Theory in Computer Science, 2004

Semantic types: a fresh look at the ideal model for types.

[BibT_eX]

[DOI]

Jerome Vouillon

Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

Asynchronous Games 2: The True Concurrency of Innocence.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2002

Double Categories: A Modular Model of Multiplicative Linear Logic.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2002

Axiomatic Rewriting Theory VI Residual Theory Revisited.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2000

Axiomatic rewriting theory II: the λσ-calculus enjoys finite normalisation cones.

[BibT_eX]

[DOI]

J. Log. Comput., 2000

1999

Concurrent Games and Full Completeness.

[BibT_eX]

[DOI]

Samson Abramsky

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

A Stability Theorem in Rewriting Theory.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

On a Duality Between Kruskal and Dershowitz Theorems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

A Factorisation Theorem in Rewriting Theory.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996

A Generic Normalisation Proof for Pure Type Systems.

[BibT_eX]

[DOI]

Benjamin Werner

Proceedings of the Types for Proofs and Programs, 1996

On the Subject Reduction Property for Algebraic Type Systems.

[BibT_eX]

[DOI]

Gilles Barthe

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995

Typed lambda-calculi with explicit substitutions may not terminate.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 1995

1992

An abstract standardisation theorem

[BibT_eX]

[DOI]

Georges Gonthier

Jean-Jacques Lévy