| Logics and type systems JH Geuvers [Sl: sn], 1993 | 232 | 1993 |
| Modular proof of strong normalization for the calculus of constructions H Geuvers, MJ Nederhof J. Funct. Program. 1 (2), 155-189, 1991 | 184 | 1991 |
| Proof assistants: History, ideas and future H Geuvers Sadhana 34, 3-25, 2009 | 153 | 2009 |
| Proof-assistants using dependent type systems H Barendregt, H Geuvers Handbook of automated reasoning, 1149-1238, 2001 | 147 | 2001 |
| Selected papers on Automath RP Nederpelt, JH Geuvers, editors Roel, C De Vrijer North-Holland, 1994 | 133 | 1994 |
| Inductive and coinductive types with iteration and recursion JH Geuvers Bastad: Chalmers University of Technology, 1992 | 131 | 1992 |
| C-CoRN, the constructive Coq repository at Nijmegen L Cruz-Filipe, H Geuvers, F Wiedijk Mathematical Knowledge Management: Third International Conference, MKM 2004 …, 2004 | 123 | 2004 |
| The Church-Rosser property for βη-reduction in typed λ-calculi JH Geuvers [Sl]: IEEE, 1992 | 100 | 1992 |
| A short and flexible proof of strong normalization for the calculus of constructions H Geuvers Types for Proofs and Programs: International Workshop TYPES'94 Båstad …, 2005 | 86 | 2005 |
| Automation of Higher-Order Logic. C Benzmüller, D Miller Computational Logic 9, 215-254, 2014 | 83 | 2014 |
| A constructive algebraic hierarchy in Coq H Geuvers, R Pollack, F Wiedijk, J Zwanenburg Journal of Symbolic Computation 34 (4), 271-286, 2002 | 80 | 2002 |
| Explicit substitution on the edge of strong normalization R Bloo, H Geuvers Theoretical Computer Science 211 (1-2), 375-395, 1999 | 80 | 1999 |
| Type theory and formal proof: an introduction R Nederpelt, H Geuvers Cambridge University Press, 2014 | 69 | 2014 |
| Modularity of strong normalization and confluence in the algebraic-/spl lambda/-cube F Barbanera, M Fernández, H Geuvers Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 406-415, 1994 | 68 | 1994 |
| Modularity of strong normalization in the algebraic-λ-cube F Barbanera, M Fernández, H Geuvers Journal of functional programming 7 (6), 613-660, 1997 | 67 | 1997 |
| A constructive proof of the fundamental theorem of algebra without using the rationals H Geuvers, F Wiedijk, J Zwanenburg Types for Proofs and Programs: International Workshop, TYPES 2000 Durham, UK …, 2002 | 64 | 2002 |
| Constructive reals in Coq: Axioms and categoricity H Geuvers, M Niqui Types for Proofs and Programs: International Workshop, TYPES 2000 Durham, UK …, 2002 | 53 | 2002 |
| Induction is not derivable in second order dependent type theory H Geuvers Typed Lambda Calculi and Applications: 5th International Conference, TLCA …, 2001 | 47 | 2001 |
| On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study H Geuvers, B Werner Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 320-329, 1994 | 42 | 1994 |
| Open proofs and open terms: A basis for interactive logic H Geuvers, GI Jojgov Computer Science Logic: 16th International Workshop, CSL 2002 11th Annual …, 2002 | 40 | 2002 |
Josef UrbanDistinguished Researcher at Czech Technical University in PragueVerified email at cvut.cz
