Thierry Coquand
Visar 86 publikationer
A foundation for synthetic algebraic geometry
Type Theory with Explicit Universe Polymorphism
REDUCTION FREE NORMALIZATION FOR A PROOF-IRRELEVANT TYPE OF PROPOSITIONS
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
Canonicity and homotopy canonicity for cubical type theory
Constructive sheaf models of type theory
On generalized algebraic theories and categories with families
Homotopy canonicity for cubical type theory
A Normalizing Computation Rule for Propositional Extensionality in Higher-Order Minimal Logic
RING DIVIDERS AND KRULL RINGS (A CONSTRUCTIVE APPROACH)
A generalization of the Takeuti-Gandy interpretation
A Kripke model for simplicial sets
Théorie des types dépendants et axiome d'univalence
A Presheaf Model of Parametric Type Theory
A Sheaf Model of the Algebraic Closure
Recursive Functions and Constructive Mathematics
Revisiting Zariski Main Theorem from a constructive point of view
Dynamic Newton-Puiseux theorem
A constructive version of Laplace's proof on the existence of complex roots
Computing persistent homology within Coq/SSReflect
A Formal Proof of the Sasaki-Murao Algorithm
Coherent and Strongly Discrete Rings in Type Theory
A computational interpretation of forcing in type theory
A Decision Procedure for Regular Expression Equivalence in Type Theory
Constructive Finite Free Resolutions
Metric complements of overt closed sets
A modular type-checking algorithm for type theory with singleton types
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
A Note on Forcing and Type Theory
Curves and coherent Prüfer rings
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
Spectral schemes as ringed lattices
Constructive Krull Dimension. I: Integral Extensions
Constructive Gelfand duality for C*-algebras
A simple type-theoretic language: Mini-TT
On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory
Verifying a semantic βη-conversion test for martin-löf type theory
A note on the axiomatisation of real numbers
Towards constructive homological algebra in type theory
Normalization by Evaluation for Martin-Löf Type Theory with Equality Judgements
Untyped algorithmic equality for Martin-Löf's logical framework with surjective pairs
The completeness of typing for context-semantics
A Proof of Strong Normalisation Using Domain Theory
Remarks on the equational theory of non-normalizing pure type systems
A logical approach to abstract algebra
Preface of special issue on formal topology
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs.
Completeness Theorems and lambda-Calculus.
An elementary characterization of Krull dimension
Formalising Bitonic Sort in Type Theory
About Stone Notion of Spectrum
A logical approach to abstract algebra
Formal topology and constructive mathematics: the Gelfand and Stone-Yosida representation theorems.
A constructive proof of the Peter-Weyl theorem
Connecting a Logical Framework to a First-Order Logic Prover.
A Completeness Proof for Geometrical Logic
A Logical Framework with Dependently Typed Records.
Generating non-Noetherian modules constructively
La contribution de Kolmogoroven logique intuitioniste
Sur un théorème de Kronecker concernant les variétés algébriques
Proof-theoretical analysis of order relations
A note on measures with values in a partially ordered vector space.
On a theorem of Kronecker about algebraic sets
Generating non noetherian modules constructively
Newman's lemma - a case study in proof automation and geometric logic
Inductively generated formal topologies
A Logical Framework with Dependently Typed Records
A syntactical proof of the marriage lemma
Compact spaces and distributive lattices
Intuitionistic model constructions and normalization proofs
Inductive definitions and type theory an introduction (preliminary version)
Intuitionistic model constructions and normalization proofs
Ladda ner publikationslistor
Du kan ladda ner denna lista till din dator.
Filtrera och ladda ner publikationslista
Som inloggad användare hittar du ytterligare funktioner i MyResearch.
Du kan även exportera direkt till Zotero eller Mendeley genom webbläsarplugins. Dessa hittar du här:
Zotero Connector
Mendeley Web Importer
Tjänsten SwePub erbjuder uttag av Researchs listor i andra format, till exempel kan du få uttag av publikationer enligt Harvard och Oxford i .RIS, BibTex och RefWorks-format.