No. Title Author Year
1 A Normalizing Computation Rule for Propositional Extensionality in Higher-Order Minimal Logic Adams, Robin et al. 2018
2 Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom Cohen, Cyril et al. 2018
3 Realizability at Work: Separating Two Constructive Notions of Finiteness Bezem, Marc et al. 2018
4 The Ackermann Award 2016 Coquand, Thierry et al. 2016
5 The Independence of Markovís Principle in Type Theory Coquand, Thierry et al. 2016
6 Non-Constructivity in Kan Simplicial Sets Bezem, Marc et al. 2015
7 A Model of Type Theory in Cubical Sets Bezem, Marc et al. 2014
8 The Ackermann Award 2012 Coquand, Thierry et al. 2012
9 05021 Abstracts Collection -- Mathematics, Algorithms, Proofs Coquand, Thierry et al. 2006
10 05021 Executive Summary -- Mathematics, Algorithms, Proofs Coquand, Thierry 2006
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI