Thierry Coquand

Thierry Coquand (born 18 April 1961 in Jallieu, Isère, France) is a professor in computer science at the University of Gothenburg, Sweden. He is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2016
02419892016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
In this note we show that Voevodsky’s univalence axiom holds in the model of type theory based on cubical sets as described in [2… (More)
Is this relevant?
Review
2017
Review
2017
In this survey we determine an explicit set of generators of the maximal ideals in the ring R[x1, . . . , xn] of polynomials in n… (More)
Is this relevant?
2010
2010
This paper sketches an approach to the synthesis of provably correct model transformations within the Coq theorem prover, an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
We present an explicitly typed lambda calculus “à la Church” based on the union and intersection types discipline; this system is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
 
Is this relevant?
2007
2007
The Traverso-Swan theorem says that a reduced ring A is seminormal if and only if the natural homomorphism PicA→ PicA[X] is an… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Research in dependent type theories [M-L71a] has, in the past, concentrated on its use in the presentation of theorems and… (More)
  • table 2.1
  • table 2.3
  • table 2.2
  • table 2.4
  • table 2.6
Is this relevant?
1997
1997
The calculus of constructions is formulated as a natural deduction system in which deductions follow the constructions of the… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
 
Is this relevant?