Výsledky vyhľadávania - "Logic in Computer Science"

Proceedings The 13th International Workshop on Theorem proving components for Educational software Autor Narboux, Julien, Neuper, Walther, Quaresma, Pedro

“…The ThEdu series pursues the smooth transition from an intuitive way of doing mathematics at secondary school to a more formal approach to the subject in STEM education while favoring software support…”
Získať plný text

Large language models (LLMs) as agents for augmented democracy Autor Gudiño, Jairo F, Grandi, Umberto, Hidalgo, César

“… both: a subject's individual political choices and the aggregate preferences of the full sample of participants…”
Zistit podrobnosti o prístupe

Adding Negation to Lambda Mu Autor van Bakel, Steffen

“… We will define a notion of reduction that extends $\lambda\mu$'s reduction system with two new reduction rules, and show that the system satisfies subject reduction…”
Získať plný text

A Behavioral Theory for Distributed Systems with Weak Recovery Autor Fabbretti, Giovanni, Lanese, Ivan, Stefani, Jean-Bernard

“…Distributed systems can be subject to various kinds of partial failures, therefore building fault-tolerance or failure mitigation mechanisms for distributed systems remains an important domain of research…”
Získať plný text

Deconfined Global Types for Asynchronous Sessions Autor Dagnino, Francesco, Giannini, Paola, Dezani-Ciancaglini, Mariangiola

“… Our type system improves the state-of-the-art by typing all asynchronous sessions and preserving the key properties of Subject Reduction, Session Fidelity and Progress when some well-formedness conditions are satisfied…”
Získať plný text

Degrees of extensionality in the theory of B\"ohm trees and Sall\'e's conjecture Autor Intrigila, Benedetto, Manzonetto, Giulio, Polonsky, Andrew

“… The lambda-calculus also possesses a strong notion of extensionality called "the omega-rule", which has been the subject of many investigations…”
Získať plný text

Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions Autor Pears, Jonah, Bocchi, Laura, Murgia, Maurizio, King, Andy

“…Mixed-choice has long been barred from models of asynchronous communication since it compromises the decidability of key properties of communicating…”
Získať plný text

Quantifying over Boolean announcements Autor van Ditmarsch, Hans, French, Tim

“… The logic BAPAL is the subject of this work. Unlike APAL it has a finitary axiomatization. Also, BAPAL is not at least as expressive as APAL. A further claim that BAPAL is decidable is deferred to a companion paper…”
Získať plný text

A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications Autor Santo, José Espírito, Kesner, Delia, Peyrot, Loïc

“…We introduce a call-by-name lambda-calculus $\lambda Jn$ with generalized applications which is equipped with distant reduction. This allows to unblock…”
Získať plný text

The taming of the rew: a type theory with computational assumptions Autor Cockx, Jesper, Tabareau, Nicolas, Winterhalter, Théo

“…Dependently typed programming languages and proof assistants such as Agda and Coq rely on computation to automatically simplify expressions during type…”
Získať plný text

Semialgebras and Weak Distributive Laws Autor Petrişan, Daniela, Sarkis, Ralph

Získať plný text

Static analysis of cloud elasticity Autor Garcia, Abel, Laneve, Cosimo, Lienhardt, Michael

“…We propose a static analysis technique that computes upper bounds of virtual machine usages in a concurrent language with explicit acquire and release…”
Získať plný text

Java & Lambda: a Featherweight Story Autor Bettini, Lorenzo, Bono, Viviana, Dezani-Ciancaglini, Mariangiola, Giannini, Paola, Venneri, Betti

“…We present FJ&$\lambda$, a new core calculus that extends Featherweight Java (FJ) with interfaces, supporting multiple inheritance in a restricted form,…”
Získať plný text

The Big-O Problem Autor Chistikov, Dmitry, Kiefer, Stefan, Murawski, Andrzej S., Purser, David

“…Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater…”
Získať plný text

The undecidability of proof search when equality is a logical connective Autor Miller, Dale, Viel, Alexandre

“…One proof-theoretic approach to equality in quantificational logic treats equality as a logical connective: in particular, term equality can be given both left…”
Získať plný text

Proof-checking Euclid Autor Beeson, Michael, Narboux, Julien, Wiedijk, Freek

“…We used computer proof-checking methods to verify the correctness of our proofs of the propositions in Euclid Book I. We used axioms as close as possible to…”
Získať plný text

Algorithmic Reduction of Biological Networks with Multiple Time Scales Autor Kruff, Niclas, Lüders, Christoph, Radulescu, Ovidiu, Sturm, Thomas, Walcher, Sebastian

“… Our reduction is mathematically justified within a singular perturbation setting. The existence of invariant manifolds is subject to hyperbolicity conditions, for which we propose an algorithmic test based on Hurwitz criteria…”
Získať plný text

Constructive Solving of Raven's IQ Tests with Analogical Proportions Autor Beltran, William Correa, Prade, Henri, Richard, Gilles

“…: the remaining ninth cell is empty. In these tests, a set of candidate pictures is also given among which the subject is asked to identify the solution…”
Získať plný text

Soundness and Completeness Proofs by Coinductive Methods Autor Blanchette, Jasmin Christian, Popescu, Andrei, Traytel, Dmitriy

“… This forms the subject of several cyclic proof systems for first-order logic augmented with inductive predicate definitions studied in the literature…”
Získať plný text

Efficiently and Effectively Recognizing Toricity of Steady State Varieties Autor Grigoriev, Dima, Iosif, Alexandru, Rahkooy, Hamid, Sturm, Thomas, Weber, Andreas

“…We consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a multiplicative group or, more generally, a…”
Získať plný text