From the 1 of 4 linked papers with an AI index.
4 papers
Phase Semantic Cut-elimination for Intuitionistic Linear Logic with Least and Greatest Fixed Points
Jun Suzuki, Charles Grellois, Katsuhiko Sano
This paper establishes the cut-elimination theorem for intuitionistic propositional multiplicative-additive linear logic with the least and greatest fixpoints (IMALL) by means…
A coalgebraic higher-order modal fixed-point logic
Ryan Tay, Harsh Beohar, Charles Grellois
We introduce a coalgebraic extension of the higher-order modal fixed-point logic (HFL) which subsumes both HFL and its probabilistic extension. We show that the emptiness problem f…
Adequate Losses via Quantitative Linear Logic
Matteo Capucci, Robert Atkey, Charles Grellois +2
The paper proposes a family of quantitative linear logics (pQLL) that combine logical specifications with differentiable loss functions for neural components, proving cut‑eliminati…
Tree Automata Acceptance up to Measurable Defect
Anita Moyasari, Harsh Beohar, Charles Grellois +1
Automata acceptance can, in several situations of interest, be captured game-theoretically via acceptance games. The existence of a winning strategy for Verifier then captures the…