Search Results - Logical Methods in Computer Science Association

Type Isomorphisms for Multiplicative-Additive Linear Logic by Di Guardia, Rémi, Laurent, Olivier

“…We characterize type isomorphisms in the multiplicative-additive fragment of linear logic (MALL), and thus in *-autonomous categories with finite products,…”
Get full text

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations by Baillot, Patrick, Lago, Ugo Dal, Kop, Cynthia, Vale, Deivid

“…The class of type-two basic feasible functionals ($\mathtt{BFF}_2$) is the analogue of $\mathtt{FP}$ (polynomial time functions) for type-2 functionals, that…”
Get full text

Half-Positional Objectives Recognized by Deterministic Büchi Automata by Bouyer, Patricia, Casares, Antonio, Randour, Mickael, Vandenhove, Pierre

“…In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies…”
Get full text

Strategies as Resource Terms, and their Categorical Semantics by Blondeau-Patissier, Lison, Clairambault, Pierre, Auclair, Lionel Vaux

“…As shown by Tsukada and Ong, simply-typed, normal and eta-long resource terms correspond to plays in Hyland-Ong games, quotiented by Melliès' homotopy…”
Get full text

Reasonable Space for the Lambda-Calculus, Logarithmically by Accattoli, Beniamino, Lago, Ugo Dal, Vanoni, Gabriele

“…Can the λ-calculus be considered a reasonable computational model? Can we use it for measuring the time and space consumption of algorithms? While the…”
Get full text

Shrub-depth: Capturing Height of Dense Graphs by Ganian, Robert, Hliněný, Petr, Nešetřil, Jaroslav, Obdržálek, Jan, de Mendez, Patrice Ossona

“…The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question:…”
Get full text

Superposition for Lambda-Free Higher-Order Logic by Bentkamp, Alexander, Blanchette, Jasmin, Cruanes, Simon, Waldmann, Uwe

“…We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow…”
Get full text

Good-for-games $\omega$-Pushdown Automata by Lehtinen, Karoliina, Zimmermann, Martin

“…We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed…”
Get full text

Completeness of the ZX-Calculus by Jeandel, Emmanuel, Perdrix, Simon, Vilmart, Renaud

“…The ZX-Calculus is a graphical language for diagrammatic reasoning in quantum mechanics and quantum information theory. It comes equipped with an equational…”
Get full text

Games Where You Can Play Optimally with Arena-Independent Finite Memory by Bouyer, Patricia, Roux, Stéphane Le, Oualhadj, Youssouf, Randour, Mickael, Vandenhove, Pierre

“…For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious…”
Get full text

The Many-Worlds Calculus by Chardonnet, Kostia, de Visme, Marc, Valiron, Benoît, Vilmart, Renaud

“…In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the…”
Get full text

The height of piecewise-testable languages and the complexity of the logic of subwords by Karandikar, Prateek, Schnoebelen, Philippe

“…The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height…”
Get full text

Characterising memory in infinite games by Casares, Antonio, Ohlmann, Pierre

“…This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of…”
Get full text

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^$ is Even Harder by Fortin, Marie, Kuijer, Louwe B., Totzke, Patrick, Zimmermann, Martin

“…Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most…”
Get full text

A Recursive Approach to Solving Parity Games in Quasipolynomial Time by Lehtinen, Karoliina, Parys, Paweł, Schewe, Sven, Wojtczak, Dominik

“…Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity…”
Get full text

From Thin Concurrent Games to Generalized Species of Structures (Extended Version) by Clairambault, Pierre, Olimpieri, Federico, Paquet, Hugo

“…Two families of denotational models have emerged from the semantic analysis of linear logic: dynamic models, typically presented as game semantics, and static…”
Get full text

Offline and Online Use of Interval and Set-Based Approaches for Control and State Estimation: A Selection of Methodological Approaches and Their Application by Rauh, Andreas, Lahme, Marit, Rohou, Simon, Jaulin, Luc, Dinh, Thach Ngoc, Raissi, Tarek, Fnadi, Mohamed

“…Control and state estimation procedures need to be robust against imprecisely known parameters, uncertainty in initial conditions, and external disturbances…”
Get full text

Extensional and Non-extensional Functions as Processes by Sakayori, Ken, Sangiorgi, Davide

“…Following Milner's seminal paper, the representation of functions as processes has received considerable attention. For pure $λ$-calculus, the process…”
Get full text

The categorical contours of the Chomsky-Schützenberger representation theorem by Melliès, Paul-André, Zeilberger, Noam

“…We develop fibrational perspectives on context-free grammars and on nondeterministic finite-state automata over categories and operads. A generalized CFG is a…”
Get full text

History-deterministic Timed Automata by Bose, Sougata, Henzinger, Thomas A., Lehtinen, Karoliina, Schewe, Sven, Totzke, Patrick

“…We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in…”
Get full text