Search Results - "Computer Science - Logic in Computer Science"

text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity by Cohen, Liron, Rahli, Vincent

“…$\text{TT}^{\Box}_{{\mathcal C}}$ is a generic family of effectful, extensional type theories with a forcing interpretation parameterized by modalities. This…”
Get full text

Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials by Grädel, Erich, Lücking, Niels, Naaf, Matthias

“…This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring…”
Get full text

SAT-Inspired Higher-Order Eliminations by Blanchette, Jasmin, Vukmirović, Petar

“…We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques…”
Get full text

Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties by Kapur, Deepak

“…Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity…”
Get full text

Checkpoint-based rollback recovery in session programming by Mezzina, Claudio Antares, Tiezzi, Francesco, Yoshida, Nobuko

“…To react to unforeseen circumstances or amend abnormal situations in communication-centric systems, programmers are in charge of "undoing" the interactions…”
Get full text

Proceedings Twentieth International Symposium on Logical and Semantic Frameworks with Applications by Barbosa, Haniel, Ringeissen, Christophe

“…This volume contains the proceedings of the 20th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2025), which was held in Brasilia, the…”
Get full text

Fixed Points Theorems for Non-Transitive Relations by Dubut, Jérémy, Yamada, Akihisa

“…In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several…”
Get full text

Parametricity for Nested Types and GADTs by Johann, Patricia, Ghiorzi, Enrico

“…This paper considers parametricity and its consequent free theorems for nested data types. Rather than representing nested types via their Church encodings in…”
Get full text

On The Axioms Of $\ cal{N}$-Adhesive Categories by Davide Castelnovo, Marino Miculan

“…Adhesive and quasiadhesive categories provide a general framework for the study of algebraic graph rewriting systems. In a quasiadhesive category any two…”
Get full text

The categorical contours of the Chomsky-Sch\"utzenberger 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

Modalities in homotopy type theory by Rijke, Egbert, Shulman, Michael, Spitters, Bas

“…Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for…”
Get full text

Revisiting Call-by-value B\"ohm trees in light of their Taylor expansion by Kerinec, Emma, Manzonetto, Giulio, Pagani, Michele

“…The call-by-value lambda calculus can be endowed with permutation rules, arising from linear logic proof-nets, having the advantage of unblocking some redexes…”
Get full text

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility by Lin, Anthony W., Majumdar, Rupak

“…Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables…”
Get full text

SAT-Inspired Higher-Order Eliminations by Blanchette, Jasmin, Vukmirović, Petar

“…We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques…”
Get full text

Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism by Laird, James

“…We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as…”
Get full text

Decision problems for linear recurrences involving arbitrary real numbers by Neumann, Eike

“…We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial…”
Get full text

Robustness against Read Committed for Transaction Templates with Functional Constraints by Vandevoort, Brecht, Ketsman, Bas, Koch, Christoph, Neven, Frank

“…The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput…”
Get full text

Lifting Coalgebra Modalities and $\mathsf{MELL}$ Model Structure to Eilenberg-Moore Categories by Lemay, Jean-Simon Pacaud

“…A categorical model of the multiplicative and exponential fragments of intuitionistic linear logic ($\mathsf{MELL}$), known as a \emph{linear category}, is a…”
Get full text

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic by Nguyên, Lê Thành Dũng, Straßburger, Lutz

“…Pomset logic and BV are both logics that extend multiplicative linear logic (with Mix) with a third connective that is self-dual and non-commutative. Whereas…”
Get full text

Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) by Dudenhefner, Andrej

“…Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury,…”
Get full text