Suchergebnisse - Logical Methods in Computer Science e.V

On the logical complexity of cyclic arithmetic von Das, Anupam

“… We study the logical complexity of proofs in cyclic arithmetic ($\mathsf{CA}$), as introduced in Simpson '17, in terms of quantifier alternations of formulae occurring. Writing $C\Sigma_n …”
Volltext

A Fibrational Tale of Operational Logical Relations: Pure, Effectful and Differential von Dagnino, Francesco, Gavazzo, Francesco

“… Logical relations built on top of an operational semantics are one of the most successful proof methods in programming language semantics …”
Volltext

Logical Step-Indexed Logical Relations von Dreyer, Derek, Ahmed, Amal, Birkedal, Lars

“… Appel and McAllester's "step-indexed" logical relations have proven to be a simple and effective technique for reasoning about programs in languages with semantically interesting types …”
Volltext

ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity von Frumin, Dan, Krebbers, Robbert, Birkedal, Lars

“… We present a new version of ReLoC: a relational separation logic for proving refinements of programs with higher-order state, fine-grained concurrency, …”
Volltext

Logical and Algebraic Characterizations of Rational Transductions von Filiot, Emmanuel, Gauwin, Olivier, Lhote, Nathan

“… In this context, logical and algebraic characterizations have also been proposed. Our main result is that one can decide if a rational transduction …”
Volltext

Covering and separation for logical fragments with modular predicates von Place, Thomas, Ramanathan, Varun, Weil, Pascal

“… Informally, we show that when a logical fragment is equipped …”
Volltext

On the relative asymptotic expressivity of inference frameworks von Koponen, Vera, Weitkämper, Felix

“… We consider logics with truth values in the unit interval $[0,1]$. Such logics are used to define queries and to define probability distributions. In this …”
Volltext

Proof-Relevant Logical Relations for Name Generation von Benton, Nick, Hofmann, Martin, Nigam, Vivek

“… Pitts and Stark's $\nu$-calculus is a paradigmatic total language for studying the problem of contextual equivalence in higher-order languages with name …”
Volltext

A modular construction of type theories von Blanqui, Frédéric, Dowek, Gilles, Grienenberger, Emilie, Hondet, Gabriel, Thiré, François

“… The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories …”
Volltext

Algebraic and logical descriptions of generalized trees von Courcelle, Bruno

“… Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the …”
Volltext

Shrub-depth: Capturing Height of Dense Graphs von 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: …”
Volltext

Logical relations for coherence of effect subtyping von Biernacki, Dariusz, Polesiuk, Piotr

“… In this article we present heterogeneous, biorthogonal, step-indexed logical relations for establishing the coherence of coercion semantics of programming languages with subtyping …”
Volltext

Superposition for Lambda-Free Higher-Order Logic von 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 …”
Volltext

Some observations on the logical foundations of inductive theorem proving von Hetzl, Stefan, Wong, Tin Lok

“… In this paper we study the logical foundations of automated inductive theorem proving …”
Volltext

Logical properties of random graphs from small addable classes von Dawar, Anuj, Kopczyński, Eryk

“… We establish zero-one laws and convergence laws for monadic second-order logic (MSO) (and, a fortiori, first-order logic) on a number of interesting graph …”
Volltext

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility von 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 …”
Volltext

Modalities in homotopy type theory von 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 …”
Volltext

On the Semantic Expressiveness of Iso- and Equi-Recursive Types von Devriese, Dominique, Martin, Eric Mark, Patrignani, Marco

“… Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power to enable diverging computation and to encode recursive …”
Volltext

Good-for-games $\omega$-Pushdown Automata von 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 …”
Volltext

History-deterministic Timed Automata von 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 …”
Volltext