The following pages link to Gilles Dowek (Q436401):
Displayed 50 items.
- Provably correct conflict prevention bands algorithms (Q436402) (← links)
- Yet another bijection between sequent calculus and natural deduction (Q530853) (← links)
- A calculus for automatic verification of Petri nets based on resolution and dynamic logics (Q530854) (← links)
- Proofs and algorithms. An introduction to logic and computability (Q625290) (← links)
- A formal library of set relations and its application to synchronous languages (Q654904) (← links)
- A simple proof that super-consistency implies cut elimination (Q691121) (← links)
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- On the expressive power of schemes (Q719245) (← links)
- Principles of programming languages (Q947473) (← links)
- The undecidability of pattern matching in calculi where primitive recursive functions are representable (Q1208421) (← links)
- Third order matching is decidable (Q1337691) (← links)
- Proof strategies in linear logic (Q1340963) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- A note on assumptions about Skolem functions (Q1904405) (← links)
- Causal graph dynamics (Q1951595) (← links)
- Introduction to the theory of programming languages. (Q1960263) (← links)
- From the universality of mathematical truth to the interoperability of proof systems (Q2104491) (← links)
- Eigenvariables, bracketing and the decidability of positive minimal predicate logic (Q2503325) (← links)
- The physical Church thesis as an explanation of the Galileo thesis (Q2629933) (← links)
- HOL-λσ: an intentional first-order expression of higher-order logic (Q2713352) (← links)
- (Q2751368) (← links)
- About Folding-Unfolding Cuts and Cuts Modulo (Q2752529) (← links)
- Universality in two dimensions (Q2804324) (← links)
- (Q2849867) (← links)
- On the Convergence of Reduction-based and Model-based Methods in Proof Theory (Q2866742) (← links)
- Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (Q2890178) (← links)
- The physical Church–Turing thesis and non-deterministic computation over the real numbers (Q2941592) (← links)
- Permissive-nominal logic (Q2946669) (← links)
- A Completion Method to Decide Reachability in Rewrite Systems (Q2964463) (← links)
- (Q2980113) (← links)
- (Q2980972) (← links)
- (Q3024833) (← links)
- Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques (Q3061275) (← links)
- (Q3083673) (← links)
- (Q3086782) (← links)
- (Q3119364) (← links)
- (Q3149664) (← links)
- Polarized Resolution Modulo (Q3163883) (← links)
- A Theory Independent Curry-De Bruijn-Howard Correspondence (Q3166993) (← links)
- Causal Graph Dynamics (Q3166999) (← links)
- Decidability, Introduction Rules and Automata (Q3460044) (← links)
- (Q3463667) (← links)
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence. (Q3522006) (← links)
- (Q3537709) (← links)
- (Q3571944) (← links)
- (Q3571945) (← links)
- On the Completeness of Quantum Computation Models (Q3576187) (← links)
- Truth Values Algebras and Proof Normalization (Q3612439) (← links)
- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo (Q3612625) (← links)