- Logic in Computer Science Thierry Coquand
- REMARK ON THE FORSTER-SWAN THEOREM 1. A variation on the stable range theorem
- HOW TO MEASURE BOREL SETS THIERRY COQUAND
- A Direct Proof of the Localic HahnBanach Theorem Thierry Coquand
- COMPACT SPACES AND DISTRIBUTIVE LATTICES THIERRY COQUAND
- A SYNTACTICAL PROOF OF THE MARRIAGE LEMMA THIERRY COQUAND
- NOTIONS INVARIANT BY CHANGE OF BASES THIERRY COQUAND
- Inductive Definitions and Type Theory an Introduction
- On Weyl's theorem Thierry Coquand
- A SIMPLE PROOF OF STONE-WEIRSTRASS THIERRY COQUAND
- Formal Topology with Posets Thierry Coquand
- A Note on Formal Iterated Function Systems Thierry Coquand
- Regular Expressions [1] Equivalence relation and partitions
- On the definition of the ^ function We write q.a instead of (q, a) and q.x instead of ^(q, x).
- Proof Theory in Type Theory Thierry Coquand
- A Topos Theoretic Fix Point Theorem Thierry Coquand
- Case Analysis, Variables and Parameters Thierry Coquand
- A Topos Theoretic Fix Point Theorem Thierry Coquand
- GENERATING NON-NOETHERIAN MODULES CONSTRUCTIVELY THIERRY COQUAND, HENRI LOMBARDI, CLAUDE QUITT
- Curriculum Vitae for Thierry Coquand Born 18/04/1961, Jallieu (Is`ere, France)
- Constructive Mathematics and Functional Programming
- Constructive Homological Algebra Thierry Coquand
- A LOGICAL APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI
- Constructive Algebra in Functional Programming and Type Theory
- Annales UMCS Informatica AI 3 (2005) 15-25 Annales UMCS
- Decidability Proof of LTL The goal of this note is to explain why LTL is decidable. Given an LTL formula we explain
- Finite Automata and Their Decision Proble'ms# Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-
- Infinite objects in constructive mathematics Thierry Coquand
- Auslander-Buchsbaum-Hochster May 18, 2010
- Grade and Linear Equations September 25, 2010
- A remark about the theory of local rings March 10, 2008
- On Dedekind-Kronecker-Kneser's Reciprocity Theorem August 15, 2006
- Infinite objects in constructive mathematics Thierry Coquand
- Infinite objects in constructive mathematics Thierry Coquand
- Equality and dependent type theory Oberwolfach, March 2 (with some later corrections)
- A Calculus of Definitions March 18, 2008
- A direct proof of Ramsey's Theorem September 27, 2010
- Constructive Logic Thierry Coquand
- Spaces as Distributive Lattices Thierry Coquand
- Logic in Computer Science Another presentation of natural deduction
- Course organization Textbook J.E. Hopcroft, R. Motwani, J.D. Ullman Introduction to
- Deterministic Finite Automata Definition: A deterministic finite automaton (DFA) consists of
- Finite Automata We present one application of finite automata: non trivial text
- Search algorithm Clever algorithm even for a single word
- Regular Expressions [1] Regular Expressions
- Regular Expressions [1] Warshall's algorithm
- Regular Expressions [1] Warshall's algorithm
- Constructive Mathematics in Theory and Programming Practice
- Dynamic construction of aglebraic closure and a coinductive proof of Hensel's lemma
- Comments and hints for 2009 example exams Harald Hammarstrom
- Geometric Hahn-Banach theorem Thierry Coquand
- Dynamical Methods in Algebra Dynamical Methods in Algebra [1] Dynamical Methods in Algebra
- Curves and coherent Prufer rings Thierry Coquand (
- A Simple Programming Language Type theory and functional programming
- Prufer domain Thierry Coquand
- Regular expressions Consider the regular sets denotated by the following pairs of regular expres-
- An Algorithm for TypeChecking Dependent Types Thierry Coquand
- Modules as dependently typed records Thierry Coquand, Randy Pollack and Makoto Takeyama
- AXIOMATIC SET THEORY 1 Cantor-Bendixson Analysis
- TYPE THEORY AND FUNCTIONAL PROGRAMMING
- Week 2: DFA and NFA 1. Exercise 2.2.1
- Application of ZMT March 4, 2006
- Une nouvelle caract erisation el ementaire de la dimension Thierry Coquand ( ) Henri Lombardi ( y ), Marie-Fran coise Roy ( z ),
- Global divisors on an algebraic curve January 13, 2008
- Places on algebraic curves March 10, 2008
- Completeness Theorems and -calculus Thierry Coquand
- Krull Dimension Thierry Coquand
- ABELIAN l-GROUPS, GENERALISED REALS AND OPEN LOCALES THIERRY COQUAND
- x 2 + 1 IS POSITIVE THIERRY COQUAND
- Proofs by induction, Alphabet, Strings [1] Proofs by Induction
- constructive mathematics
- Week 1: Finite Automata Proofs by induction
- Introduction In this paper, we present a theory of constructions for higher-order intuitionistic logic. The original
- CONSTRUCTIVE BAIRE CATEGORY THEOREM THIERRY COQUAND
- Computational Content of Classical Logic
- Algebraic Closure Thierry Coquand
- Pattern Matching with Dependent Types Thierry Coquand
- AXIOMATIC SET THEORY 4 Complete Boolean Algebra
- Proposition. Given n+2 polynomials g 1 , g 2 , : : : , g n+2 in n indeterminates with rational coecients, construct n+1 polynomials f 1 , f 2 , : : : , f n+1 in the same indeterminates with
- Krull Dimension of Distributive Thierry Coquand and Henri Lombardi
- Language of a Grammar If G is a grammar we write
- A proof of Higman's lemma by structural induction Thierry Coquand, Daniel Fridlender
- Hilbert's program in abstract algebra Thierry Coquand
- About Stone's general theory of Thierry Coquand
- Real Spectrum Thierry Coquand
- Algebraically Closed Fields Thierry Coquand
- Sur un th eor eme de Kronecker concernant les vari et es alg ebriques
- A New Paradox in Type Theory Thierry Coquand
- The paradox of trees in Type Theory Thierry Coquand
- A Finitary Subsystem of Polymorphic calculus Thorsten Altenkirch and Thierry Coquand
- A COMPLETENESS PROOF FOR GEOMETRICAL LOGIC THIERRY COQUAND
- ALGEBRAIC INTEGRATION THEORY THIERRY COQUAND
- About Stone's notion of Spectrum Thierry Coquand
- Infinite objects in constructive mathematics Thierry Coquand
- A hybrid MAC protocol for a metro WDM network using multiple free spectral ranges of an
- NOVIKOV'S CUTELIMINATION THIERRY COQUAND
- HOW TO DEFINE MEASURE OF BOREL SETS THIERRY COQUAND
- A Boolean Model of Ultrafilters Thierry Coquand
- Exercises on the course on Constructive Logic August 10, 2008
- Kurs: MAN321/TMV026 Andliga automater och formella sprak Plats: M-huset
- HOW TO DEFINE MEASURE OF BOREL SETS THIERRY COQUAND
- Domains for polymorphism (Isle of Thorns, August 88) Introduction
- 1. We consider the following language: we have one binary relation symbol R, and one unary function symbol f. Define what is a model for this language (2p). Give an example of a
- Coherent Ring Thierry Coquand
- The Zariski Spectrum of a ring Thierry Coquand
- Tiling rectangles Dedicated to Jan von Plato, for his 50th birthday
- THE LOGIC IN COMPUTER SCIENCE COLUMN Yuri GUREVICH
- A NOTE ON MEASURES WITH VALUES IN A PARTIALLY ORDERED VECTOR SPACE
- Entailment Relations and Distributive Lattices Jan Cederquist 1 and Thierry Coquand 2
- Finite Automata: Homework 2 1. Let be {0, 1}. Give a NFA with four states equivalent to the regular expression (01+011+
- About Stone's notion of Spectrum Thierry Coquand
- ORDINALS IN TYPE THEORY Thierry Coquand, Peter Hancock and Anton Setzer
- CONSTRUCTIVE TOPOLOGY AND COMBINATORICS Thierry Coquand
- A Finitary Version of System F Thorsten Altenkirch and Thierry Coquand
- A Constructive Analysis of the StoneWeierstrass Theorem Thierry Coquand
- A constructive topological proof of van der Waerden's theorem Thierry Coquand
- Course Notes in Typed Lambda Calculus Thierry Coquand
- Infinite Objects in Type Theory Thierry Coquand
- Main Points of the Course What has been covered: chapters 1 to 5 + 7
- Constructive Algebra Thierry Coquand
- A logical approach to abstract algebra Thierry Coquand
- Exercices on Typed LambdaCalculus Thierry Coquand
- Sequents, Frames, and Completeness Thierry Coquand 1 and GuoQiang Zhang 2??
- A Note on the Open Induction Principle Thierry Coquand
- Inductive Definitions and Type Theory an Introduction
- Lewis Carroll, Gentzen and Entailment Relations Thierry Coquand
- Space of Valuations March 14, 2008
- Kurs: MAN321/TMV026 Andliga automater Plats: M-huset
- Some Lemmas around Peskine's Proof of Zariski Main Theorem January 7, 2008
- Equality and dependent type theory Thierry Coquand
- Topology and Sequent Calculus Thierry Coquand
- We let D be the set of all untyped, maybe open, terms, with ficonversion as equality. We let c n be the lambda term xf f n x: We consider the
- On the measure problem Thierry Coquand
- Valuations and Dedekind's Prague Theorem Thierry Coquand and Henrik Persson
- On seminormality Thierry Coquand
- Infinite objects in constructive mathematics Thierry Coquand
- AXIOMATIC SET THEORY 2 Ordinal Arithmetic
- Hidden constructions in abstract algebra (3) Krull Dimension of distributive lattices and commutative
- A Constructive Analysis of StoneWeierstrass Theorem
- An Analysis of Girard's Paradox Thierry Coquand
- A new method for establishing conservativity of classical systems over their intuitionistic version
- Inductively generated formal topologies Thierry Coquand y , Giovanni Sambin z ,
- A direct proof of the Dedekind-Mertens Lemma April 5, 2006
- Some results about Measure Theory Chalmers University
- CONSTRUCTIVE METRIC COMPLETION OF BOOLEAN ALGEBRAS THIERRY COQUAND AND ERIK PALMGREN
- Invariant Measure on Compact Space Thierry Coquand
- A direct proof of Ramsey's Theorem September 26, 2011
- Constructive Kan fibrations February 27, 2012
- Types as Kan Simplicial Sets Th. Coquand (jww Simon Huber)