Paul-André Melliès is a CNRS Researcher, member of the Laboratoire PPS at the Department of Mathematical Sciences and Department of Computer Science of the Université Paris 7 - Denis Diderot. He is interested in Mathematical logic, proof theory, game semantics, theory and practice of programming languages, formalized mathematics, proof assistants, mathematical physics, knot theory, quantum groups, n-dimensional algebra, and operads (and in practice a lot more!)
His webpage is here.
On categorical semantics of linear logic with its exponential modality:
Paul-André Melliès, Categorical models of linear logic revisited (2002) [hal:00154229]
Paul-André Melliès, Categorical semantics of linear logic, in Interactive models of computation and program behaviour, Panoramas et synthèses 27 (2009) 1-196 [web, pdf, pdf]
On type refinement:
Paul-André Melliès, Noam Zeilberger, Type refinement and monoidal closed bifibrations, arXiv:1310.0263
Paul-André Melliès, Noam Zeilberger, Functors are Type Refinement Systems, (pdf , HAL)
Paul-André Melliès, Noam Zeilberger, An Isbell Duality Theorem for Type Refinement Systems, (pdf)
On the local state monad:
On the Grothendieck construction for model categories:
370 (2020) 107205 [arXiv:1709.10484, doi:10.1016/j.aim.2020.107205]
On presheaves of modules as models for intuitionistic linear logic
Last revised on August 21, 2023 at 09:25:37. See the history of this page for a list of all contributions to it.