Hasil untuk "cs.LO"

Gilles Dowek

We give a presentation of Simple Type Theory as a clausal rewrite system in Polarized deduction modulo.

Gilles Dowek, Benjamin Werner

We present constructive arithmetic in Deduction modulo with rewrite rules only.

Richard Statman, Gilles Dowek

We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the $λ$-definability conjecture implies the higher-order matching conjecture.

Gilles Dowek

Given a first-order theory and a proof that it is consistent, can we design a proof-search method for this theory that fails in finite time when it attempts to prove the formula False?

Gilles Dowek

We give a presentation of Krivine and Parigot's Second-order functional arithmetic in Deduction modulo. Expressing this theory in Deduction modulo sheds light on an original aspect of this theory: the fact that programs are specified, not with propositions, but with congruences.

Gilles Dowek

The rewriting system sigma is the set of rules propagating explicit substitutions in the lambda-calculus with explicit substitutions. In this note, we prove the undecidability of unification modulo sigma.

Andreas Nuyts

In this note, we discuss a number of parametricity features and what their requirements are in terms of complexity of the type system and its model.

Jiří Adámek

This is an introduction of the volume of the journal Commentationes Mathematicae Universitatis Caroalinae dedicated to the memory of Věra Trnková}.

Louis Abraham

We present a selective bibliography about efficient SAT solving, focused on optimizations for the CDCL-based algorithms.

Mikolaj Bojanczyk

An introduction to algebras for graphs, based on Courcelle's algebras of hyperedge replacement and vertex replacement. The paper uses monad notation.

Steven Obua

Building on the concept of local lexing the concept of parameterized local lexing is introduced.

Gilles Dowek

Classical logic is embedded into constructive logic, through a definition of the classical connectives and quantifiers in terms of the constructive ones.

Marijn J. H. Heule

This document describes the DRAT format for clausal proofs and the DRAT-trim proof checker.

Michel Lévy

We present concisely the method "Model Elimination" of D.W.Loveland. Especially, we explain and prove the correctness of the lemmas generated by this method.

Gilles Dowek

This paper is a survey on Deduction modulo theory

Lucius Gregory Meredith

We give an interpretation of full classical linear logic, and linear proofs in terms of operations on the blockchain.

Alan Perotti

Rule-based run-time monitoring system for finite traces, with FLTL verdict and quadratic complexity.

Yves Bertot

We describe the basic notions of co-induction as they are available in the coq system. As an application, we describe arithmetic properties for simple representations of real numbers.

Hubie Chen

This article surveys recent advances in applying algebraic techniques to constraint satisfaction problems.

Serban E. Vlad

We present the bounded delays, the absolute inertia and the relative inertia.