- Skeleton for the Proof development leading to the Fundamental Theorem of Algebra
- The ChurchRosser Property for fijreduction in Typed Calculi Herman Geuvers
- Induction is not derivable in second order dependent type theory
- INFORMAL PROCEEDINGS OF THE 1993 WORKSHOP ON
- Equational Reasoning via Partial Re ection H. Geuvers, F. Wiedijk, J. Zwanenburg
- On the ChurchRosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study \Lambda
- Logics and Type Systems een wetenschappelijke proeve op het gebied van de
- Congruence types ? Gilles Barthe 1;3 and Herman Geuvers 2;3
- Computer-ondersteund redeneren: de boekhouder
- A Simple Model Construction for the Calculus of Constructions
- A Constructive Proof of the Fundamental Theorem of Algebra without using the Rationals
- Foreword : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : iv Workshop Programme : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
- Modular properties of algebraic pure type Gilles Barthe 1;2? Herman Geuvers 1;3
- LFM 2004 Preliminary Version A logical framework with explicit conversions
- Extending models of second order predicate logic to models of second order dependent type theory
- Proof by Computation in the Coq system Martijn Oostdijk and Herman Geuvers
- Safe Proof Checking in Type Theory with Y Herman Geuvers 1 , Erik Poll 2 , and Jan Zwanenburg 2
- Proof-Assistants Using Dependent Type Systems
- An Interactive Algebra Course with Formalised Proofs and Definitions
- Article Submitted to Journal of Symbolic Computation A Constructive Algebraic Hierarchy in Coq
- Under consideration for publication in Math. Struct. in Comp. Science Some logical and syntactical observations
- Explicit Substitution: on the Edge of Strong Normalization Roel Bloo \Lambda
- The 2007 Federated Conference on Rewriting, Deduction and Programming
- Computer-ondersteund redeneren: de boekhouder steunt de denker
- Narrating Formal Proof (Work in Progress) Carst Tankink Herman Geuvers James McKinna
- C-CoRN, the Constructive Coq Repository at Luis Cruz-Filipe, Herman Geuvers, Freek Wiedijk
- The Calculus of Constructions and Higher Order Logic
- RADBOUD UNIVERSITEIT NIJMEGEN Faculteit Natuurwetenschappen, Wiskunde en Informatica
- Degrees of undecidability of in Term Rewriting Jorg Endrullis, Herman Geuvers, Hans Zantema
- Verification of Hybrid Systems in Coq H. Geuvers, A. Koprowski, D. Synek, E. van der Weegen
- Dutch student grants and loans system Students from an EEA country* may apply for either a student grant within the Dutch
- Pure Type Systems without Explicit Contexts Herman Geuvers, James McKinna, and Freek Wiedijk
- The correctness of Newman's typability algorithm and some of its extensions
- Introduction to Type Theory Herman Geuvers
- On Fixed point and Looping Combinators in Type Theory
- Under consideration for publication in Math. Struct. in Comp. Science Natural Deduction via Graphs
- From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of
- Open Proofs and Open Terms: a Basis for Interactive Logic
- Sadhana Vol. 34, Part 1, February 2009, pp. 123. Printed in India Proof assistants: History, ideas and future
- Constructive Reals in Coq: Axioms and Categoricity
- A short and flexible proof of Strong Normalization for the Calculus of Constructions
- (In)consistency of extensions of Higher Order Logic and Type Theory
- Inductive and Coinductive types with Iteration and Recursion \Lambda Herman Geuvers y ,
- The logic and mathematics of occasion sentences Pieter A. M. Seuren y Venanzio Capretta z Herman Geuvers z
- Automath in historisch perspectief Herman Geuvers
- Inconsistency of classical logic in type theory Herman Geuvers
- Automatisering Gids #109 maart 2007 Computerondersteund
- Rewriting for Fitch style natural deductions Herman Geuvers, Rob Nederpelt
- Newman's Typability Algorithm Herman Geuvers1
- Introduction to Type Theory Herman Geuvers
- Can the computer really help us to prove Herman Geuvers1
