We prove the undecidability of the third order pattern matching problem ...
We give a complete self-contained proof of Statman's finite completeness...
We give an algorithm for the class of second order unification problems ...
The smallest transitive relation < on well-typed normal terms such that ...
The set of pure terms which are typable in the λΠ-calculus in a
given co...
The laws of Physics are time-reversible, making no qualitative distincti...
We prove that the pattern matching problem is undecidable in polymorphic...
We present a complete proof synthesis method for the eight type systems ...
The higher order matching problem is the problem of determining whether ...
Resolution modulo is a first-order theorem proving method that can be ap...
Combining a standard proof search method, such as resolution or tableaux...
In the last decades, several objects such as grammars, economical agents...
The Stratified Foundations are a restriction of naive set theory where t...
We define an extension of predicate logic, called Binding Logic, where
v...
Deduction modulo is a way to express a theory using computation rules in...
The induction principle for natural numbers expresses that when a proper...
The goal of this note is to compare two notions, one coming from the the...
If the sequent (Gamma entails forall x exists y A) is provable in first ...
Given a first-order theory and a proof that it is consistent, can we des...
We give a new proof of a theorem of Mints that the positive fragment of
...
We extend the notion of Heyting algebra to a notion of truth values alge...
The rewriting system sigma is the set of rules propagating explicit
subs...
Peter Andrews has proposed, in 1971, the problem of finding an analog of...
We provide a semi-grammatical description of the set of normal proofs of...
In the recent past, the reduction-based and the model-based methods to p...
We give a presentation of Krivine and Parigot's Second-order functional
...
We give a presentation of Simple Type Theory as a clausal rewrite system...
The physical Church thesis is a thesis about nature that expresses that ...
We present a calculus, called the scheme-calculus, that permits to expre...
We introduce a method to prove that a proof search method is not an inst...
We give a simple and direct proof that super-consistency implies the cut...
On the real numbers, the notions of a semi-decidable relation and that o...
Instead of developing a customized typed lambda-calculus for each theory...
The possibility to describe the laws of the Universe in a computational ...
When a proposition has no proof in an inference system, it is sometimes
...
In this note, we defend that the notion of algorithm as a set of executi...
Libraries of formal proofs are an important part of our mathematical
her...
When a decision, such as the approval or denial of a bank loan, is deleg...
The basic notions of logic-predicate logic, Peano arithmetic, incomplete...
We prove a linearity theorem for an extension of linear logic with addit...
The lambda-Pi-calculus modulo theory is a logical framework in which man...
We give a presentation of Pure type systems where contexts need not be
w...
We investigate an unsuspected connection between non harmonious logical
...
System I is a proof language for a fragment of propositional logic where...
We describe the first results of a project of analyzing in which theorie...