Výsledky vyhledávání - "Logic in Computer Science"

The completeness of reasoning algorithms for clause sets in description logic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.svg" display="inline" id="d1e76"><mml:mi mathvariant="script">ALC</mml:mi></mml:math> Autor Ken Kaneiwa, Daiki Takahashi

Získat plný text

Iris from the ground up: A modular foundation for higher-order concurrent separation logic Autor JUNG, RALF, KREBBERS, ROBBERT, JOURDAN, JACQUES-HENRI, BIZJAK, ALEŠ, BIRKEDAL, LARS, DREYER, DEREK

“…Iris is a framework for higher-order concurrent separation logic, which has been implemented in the Coq proof assistant and deployed very effectively in a wide…”
Získat plný text

Type Isomorphisms for Multiplicative-Additive Linear Logic Autor 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,…”
Získat plný text

Modal Logic for Reasoning About Uncertainty and Confusion Autor Bílková, Marta, Ferguson, Thomas M., Kozhemiachenko, Daniil

Získat plný text

Complexity of Łukasiewicz Modal Probabilistic Logics Autor Kozhemiachenko, Daniil, Sedlár, Igor

Získat plný text

Bounded Sort Polymorphism with Elimination Constraints Autor Rosain, Johann, Díaz, Tomás, Maillard, Kenji, Sozeau, Matthieu, Tabareau, Nicolas, Tanter, Éric, Winterhalter, Théo

“…Proof assistants based on dependent type theory-such as Agda, Lean, and Rocq-employ different universes to classify types, typically combining a predicative…”
Získat plný text

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic Autor 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…”
Získat plný text

text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity Autor 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…”
Získat plný text

Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules Autor Echenim, Mnacho, Iosif, Radu, Peltier, Nicolas

“…Entailment is undecidable in general for Separation (SL) Logic formulae with inductive definitions, but it has been shown to be decidable [1] if the inductive…”
Získat plný text

Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials Autor 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…”
Získat plný text

Relational correspondences for L-fuzzy rough approximations defined on De Morgan Heyting algebras Autor Jouni Järvinen, Michiro Kondo

Získat plný text

Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System Autor Satoshi Kura, Hiroshi Unno

Získat plný text

On Tools for Completeness of Kleene Algebra with Hypotheses Autor Pous, Damien, Rot, Jurriaan, Wagemaker, Jana

“…In the literature on Kleene algebra, a number of variants have been proposed which impose additional structure specified by a theory, such as Kleene algebra…”
Získat plný text

Proofs for Free in the λΠ-Calculus Modulo Theory Autor Traversié, Thomas

Získat plný text

Kuroda's Translation for the λΠ-Calculus Modulo Theory and Dedukti Autor Traversié, Thomas

Získat plný text

RustBelt: securing the foundations of the Rust programming language Autor Jung, Ralf, Jourdan, Jacques-Henri, Krebbers, Robbert, Dreyer, Derek

“…Rust is a new systems programming language that promises to overcome the seemingly fundamental tradeoff between high-level safety guarantees and low-level…”
Získat plný text

Superposition for Lambda-Free Higher-Order Logic Autor 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…”
Získat plný text

Integration in Cones Autor Ehrhard, Thomas, Geoffroy, Guillaume

“…Measurable cones, with linear and measurable functions as morphisms, are a model of intuitionistic linear logic and of call-by-name probabilistic PCF which…”
Získat plný text

A coherent differential PCF Autor Ehrhard, Thomas

“…The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions…”
Získat plný text

Generalizing determinization from automata to coalgebras Autor Silva, Alexandra, Bonchi, Filippo, Bonsangue, Marcello, Rutten, Jan

“…The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this…”
Získat plný text