Thierry Coquand

Full Professor at Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Link to personal page

Source: chalmers.se

Showing 80 publications

2018

A Normalizing Computation Rule for Propositional Extensionality in Higher-Order Minimal Logic

Robin Adams, Marc Bezem, Thierry Coquand
Paper in proceedings
2016

RING DIVIDERS AND KRULL RINGS (A CONSTRUCTIVE APPROACH)

Thierry Coquand, H. Lombardi
Communications in Algebra. Vol. 44 (2), p. 515-567
Journal article
2016

The Ackermann Award 2016

Thierry Coquand, Anuj Dawar
Leibniz International Proceedings in Informatics, LIPIcs. Vol. 62
Paper in proceedings
2015

A presheaf model of parametric type theory

Jean-Philippe Bernardy, Thierry Coquand, Guilhem Moulin
Preprint
2015

Théorie des types dépendants et axiome d'univalence

Thierry Coquand
Asterisque, p. 367-386
Journal article
2015

A Presheaf Model of Parametric Type Theory

Jean-Philippe Bernardy, Thierry Coquand, Guilhem Moulin
Electronic Notes in Theoretical Computer Science. Vol. 319, p. 67-82
Journal article
2015

A Kripke model for simplicial sets

M. Bezem, Thierry Coquand
Theoretical Computer Science. Vol. 574, p. 86-91
Journal article
2015

A generalization of the Takeuti-Gandy interpretation

B. Barras, Thierry Coquand, Simon Huber
Mathematical Structures in Computer Science. Vol. 25 (5), p. 1071-1099
Journal article
2014

A Sheaf Model of the Algebraic Closure

Bassel Mannaa, Thierry Coquand
Proceedings Fifth International Workshop on Classical Logic and Computation (CL&C 2014), Vienna, Austria, July 13, 2014, EPTCS. Vol. 164, p. 18-32
Paper in proceedings
2014

Revisiting Zariski Main Theorem from a constructive point of view

M. E. Alonso, Thierry Coquand, H. Lombardi
Journal of Algebra. Vol. 406, p. 46-68
Journal article
2014

Recursive Functions and Constructive Mathematics

Thierry Coquand
CONSTRUCTIVITY AND COMPUTABILITY IN HISTORICAL AND PHILOSOPHICAL PERSPECTIVE
Paper in proceedings
2013

Isomorphism is equality

Thierry Coquand, Nils Anders Danielsson
Indagationes Mathematicae. Vol. 24 (4), p. 1105-1120
Journal article
2013

Computing persistent homology within Coq/SSReflect

J. Heras, Thierry Coquand, Anders Mörtberg et al
ACM Transactions on Computational Logic. Vol. 14 (4), p. 26-
Journal article
2013

About Goodman's Theorem

Thierry Coquand
Annals of Pure and Applied Logic. Vol. 164 (4), p. 437-442
Journal article
2013

A constructive version of Laplace's proof on the existence of complex roots

Cyril Cohen, Thierry Coquand
Journal of Algebra. Vol. 381 (1), p. 110-115
Journal article
2013

Dynamic Newton-Puiseux theorem

Bassel Mannaa, Thierry Coquand
Journal of Logic and Analysis. Vol. 5, p. (5:5) 1-22
Journal article
2012

A computational interpretation of forcing in type theory

Thierry Coquand, G. Jaber
Epistemology versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of per Martin-Löf, p. 203-213
Book chapter
2012

Coherent and Strongly Discrete Rings in Type Theory

Anders Mörtberg, Thierry Coquand, Vincent Siles
CPP 2012, LNCS. Vol. 7679, p. 273-288
Paper in proceedings
2012

A Formal Proof of the Sasaki-Murao Algorithm

Thierry Coquand, Anders Mörtberg, Vincent Siles
Journal of Formalized Reasoning. Vol. 5 (1), p. 27-36
Journal article
2011

Unique path as formal points

Thierry Coquand, Peter Schuster
Journal of Logic and Analysis. Vol. 3
Journal article
2011

Metric complements of overt closed sets

Thierry Coquand, E. Palmgren, Bas Spitters
Mathematical Logic Quarterly. Vol. 57 (4), p. 373-378
Journal article
2011

A Decision Procedure for Regular Expression Equivalence in Type Theory

Thierry Coquand, Vincent Siles
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7086, p. 119-134
Paper in proceedings
2011

Constructive Finite Free Resolutions

Thierry Coquand, Claude Quitte
Manuscripta Mathematica. Vol. 137, p. 331-345
Journal article
2011

A MODULAR TYPE-CHECKING ALGORITHM FOR TYPE THEORY WITH SINGLETON TYPES AND PROOF IRRELEVANCE

A Abel, Thierry Coquand, M Pagano
Logical Methods in Computer Science. Vol. 7 (2)
Journal article
2011

A modular type-checking algorithm for type theory with singleton types

Miguel Pagano, Andreas Abel, Thierry Coquand
Logical Methods in Computer Science. Vol. 7
Journal article
2010

A Note on Forcing and Type Theory

Thierry Coquand, Guilhem Jaber
Fundamenta Informaticae. Vol. 100 (1-4), p. 43-52
Journal article
2010

Curves and coherent Prufer rings

Thierry Coquand, Henri Lombardi, Claude Quitte
Journal of Symbolic Computation. Vol. 45 (12), p. 1378-1390
Journal article
2010

Games with 1-backtracking

S. Berardi, Thierry Coquand, S. Hayashi
Annals of Pure and Applied Logic. Vol. 161 (10), p. 1254-1269
Journal article
2009

A simple type-theoretic language: Mini-TT

Thierry Coquand, Y. Kinoshita, Bengt Nordström et al
From Semantics to Computer Science : Essays in Honour of Gilles Kahn, p. 139-164
Book chapter
2009

Space of Valuations

Thierry Coquand
Annals of Pure and Applied Logic. Vol. 157, p. 97-109
Journal article
2009

Integrals and Valuations

Thierry Coquand, Bas Spitters
Logic and Analysis. Vol. 1
Journal article
2009

forcing in type theory

Thierry Coquand
Proceeding of CSL 09, p. 2-
Journal article
2009

Constructive Krull Dimension. I: Integral Extensions

Thierry Coquand, Lionel Ducos, Henri Lombardi et al
Journal of Algebra and its Applications. Vol. 8 (1), p. 129-138
Journal article
2009

Constructive Gelfand duality for C*-algebras

Thierry Coquand, Bas Spitters
Mathematical Proceedings of the Cambridge Philosophical Society. Vol. 147, p. 339-344
Journal article
2009

Spectral schemes as ringed lattices

Thierry Coquand, Henri Lombardi, Peter Schuster
Annals of Mathematics and Artificial Intelligence. Vol. 56 (3-4), p. 339-360
Journal article
2008

A note on the axiomatisation of real numbers

Thierry Coquand
Math.Log. Q.. Vol. 54, p. 224-228
Journal article
2008

On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory

Andreas Abel, Thierry Coquand, Peter Dybjer
FLOPS 2008, p. 3-13
Paper in proceedings
2008

Verifying a semantic βη-conversion test for martin-löf type theory

Andreas Abel, Thierry Coquand, Peter Dybjer
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), p. 29-56
Paper in proceedings
2007

The completeness of typing for context-semantics

Thierry Coquand
Fundamenta Informaticae. Vol. 77 (4), p. 293-301
Journal article
2007

Towards constructive homological algebra in type theory

Thierry Coquand, Arnaud Spiwack
Proceeding of Calculemus 2007
Paper in proceedings
2007

Untyped algorithmic equality for Martin-Löf's logical framework with surjective pairs

Andreas Abel, Thierry Coquand
Fundamenta Informaticae. Vol. 77 (4), p. 345-395
Journal article
2007

Normalization by Evaluation for Martin-Löf Type Theory with Equality Judgements

Andreas Abel, Thierry Coquand, Peter Dybjer
Proceedings of 22nd IEEE Annual Symposium on Logic in ComputerScience, Wroclaw, Poland, July 2007., p. 3-12
Journal article
2006

Preface of special issue on formal topology

Thierry Coquand, Giovanni Sambin
Annals of Pure and Applied Logic. Vol. 137 (1-3), p. 1-2
Journal article
2006

A Proof of Strong Normalisation Using Domain Theory

Thierry Coquand, Arnaud Spiwack
proceeding of Logic in Computer Science, 2006
Paper in proceedings
2006

Geometric Hahn-Banach theorem

Thierry Coquand
Math. Proc. Cambridge Philos. Soc. Vol. 140 (2), p. 313-315
Journal article
2006

A logical approach to abstract algebra

Thierry Coquand, Henri Lombardi
Mathematical Structures in Computer Science. Vol. 16 (5), p. 885-900
Journal article
2006

Remarks on the equational theory of non-normalizing pure type systems

Gilles Barthes, Thierry Coquand
Journal of Functional Programming. Vol. 16 (2), p. 137-155
Journal article
2006

On seminormality

Thierry Coquand
Journal of Algebra. Vol. 305 (1), p. 577-584
Journal article
2005

Connecting a Logical Framework to a First-Order Logic Prover.

Thierry Coquand, Andreas Abel, Ulf Norell
FroCos 2005, p. 285-301
Paper in proceedings
2005

Formal topology and constructive mathematics: the Gelfand and Stone-Yosida representation theorems.

Thierry Coquand, Bas Spiiters
J.UCS 11. Vol. 11 (12), p. 1932-1944
Journal article
2005

A nilregular element property.

Thierry Coquand, Henri Lombardi, Peter Schuster
Arch. Math. (Basel). Vol. 85, p. 49-54
Journal article
2005

About Stone Notion of Spectrum

Thierry Coquand
Journal of Pure and Applied Algebra. Vol. 197 (1-3), p. 141-158
Journal article
2005

A Completeness Proof for Geometrical Logic

Thierry Coquand
Logic, Methodology and Philosophy of Sciences. Preceedings of the Twelfth International Congress. Hajek, Valdes-Villuaneva, Westerstahl, editors, p. 79-90
Journal article
2005

Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs.

Thierry Coquand, Andreas Abel
Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA 2005); in: LECTURE NOTES IN COMPUTER SCIENCE , Volume: 3461), p. 23-38
Paper in proceedings
2005

Automating Coherent Logic.

Thierry Coquand, Marc Bezem
LPAR 2005, p. 246-260
Journal article
2005

A constructive proof of the Peter-Weyl theorem

Thierry Coquand, Bas Spitters
MLQ Math. Log. Q.. Vol. 51, p. 351-359
Journal article
2005

A Logical Approach to Abstract Algebra.

Thierry Coquand
CiE2005, p. 86-95
Journal article
2005

An elementary characterization of Krull dimension

Thierry Coquand, Henri Lombardi, Marie-Francoise Roy
From Sets and Types to Topology and Analysis. Towards Practicable Foundations for Constructive Mathematics. (L. Crosilla, P. Schuster, eds.). Oxford University Press,, p. 239-244
Book chapter
2005

Completeness Theorems and lambda-Calculus.

Thierry Coquand
TLCA 2005, p. 1-9
Journal article
2005

A Logical Framework with Dependently Typed Records.

Thierry Coquand, Makoto Takeyama, Randy Pollack
Fundam. Inform.. Vol. 65, p. 113-134
Journal article
2005

Formalising Bitonic Sort in Type Theory

Ana Bove, Thierry Coquand
Types for Proofs and Programs TYPES 2004. Vol. LNCS 3839, p. 82-97
Paper in proceedings
2004

Proof-theoretical analysis of order relations

S. Negri, J. von Plato, Thierry Coquand
Archive for Mathematical Logic. Vol. 43 (3), p. 297-309
Journal article
2004

A note on measures with values in a partially ordered vector space.

Thierry Coquand
Positivity. Vol. 8, p. 395-400
Journal article
2004

Generating non noetherian modules constructively

Thierry Coquand, H. Lombardi, C. Quitte
Manuscripta Mathematica. Vol. 115 (4), p. 513-520
Journal article
2004

Generating non-Noetherian modules constructively

Thierry Coquand, Henri Lombardi, Claude Quitte
Manuscripta Math. Vol. 115 (4), p. 513-520
Journal article
2004

On a theorem of Kronecker about algebraic sets

Thierry Coquand
C. R. Math. Acad. Sci. Paris. Vol. 338 (4), p. 291-294
Journal article
2004

La contribution de Kolmogoroven logique intuitioniste

Thierry Coquand
Lhéritage de Kolmogorov en mathématiques
Book chapter
2004

Sur un théorème de Kronecker concernant les variétés algébriques

Thierry Coquand
Comptes Rendus Mathematique. Vol. 338 (4), p. 291-294
Journal article
2003

A syntactical proof of the marriage lemma

Thierry Coquand
Theoretical Computer Science. Vol. 290 (1), p. 1107-1113
Journal article
2003

Newman's lemma - a case study in proof automation and geometric logic

Marc Bezem, Thierry Coquand
Bulletin of the European Association for Theoretical Computer Science. Vol. 79, p. 86-100
Journal article
2003

Inductively generated formal topologies

Thierry Coquand, G. Sambin, Jan Smith et al
Annals of Pure and Applied Logic. Vol. 124 (1-3), p. 71-106
Journal article
2003

Compact spaces and distributive lattices

Thierry Coquand
Journal of Pure and Applied Algebra. Vol. 184 (1), p. 1-6
Journal article
2003

A Logical Framework with Dependently Typed Records

Thierry Coquand, R. Pollack, Makoto Takeyama
Lecture Notes in Computer Science. 6th International Conference on Typed Lambda Calculi and Applications (TLCA 2003), Valencia, 10-12 June 2003. Vol. 2701, p. 105-119
Paper in proceedings
2003

Hidden constructions in abstract algebra: Krull dimension of distributive lattices and commutative rings

Thierry Coquand, Henri Lombardi
Lecture Notes in Pure and Applied Mathematics. Vol. 231, p. 477-499
Paper in proceedings
1997

Intuitionistic model constructions and normalization proofs

Peter Dybjer, Thierry Coquand
Mathematical Structures in Computer Science. Vol. 7, p. 75-94
Journal article
1997

Intuitionistic choice and classical logic

Thierry Coquand, Erik Palmgren
Preprint
1994

Inductive definitions and type theory an introduction (preliminary version)

Peter Dybjer, Thierry Coquand
Foundation of Software Technology and Theoretical Computer Science: 14th Conference Madras, India; (Lecture Notes in Computer Science; 880). Vol. 880, p. 60-76
Paper in proceedings
1993

Intuitionistic model constructions and normalization proofs

Peter Dybjer, Thierry Coquand
Proceedings of the 1993 TYPES Workshop, Nijmegen, p. 85-109
Conference contribution

Save references

If you have installed Zotero or Mendeley on your computer you can use a plugin to extract references from the publications you see.

Download plugins:
Zotero
Mendeley

There are no projects.
There might be more projects where Thierry Coquand participates, but you have to be logged in as a Chalmers employee to see them.