#### Filter Results:

- Full text PDF available (78)

#### Publication Year

1991

2017

- This year (4)
- Last 5 years (22)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Herman Geuvers, Mark-Jan Nederhof
- J. Funct. Program.
- 1991

- Herman Geuvers
- 1992

In this paper we investigate the Church-Rosser property (CR) for Pure Type Systems with-reduction. For Pure Type Systems with only-reduction, CR on well typed terms follows immediately from CR on the so called 'pseudoterms' and subject reduction. For-reduction, CR on the set of pseudoterms is just false, as was shown by Nederpelt 1973]. Here we prove that… (More)

- Hendrik Pieter Barendregt, Herman Geuvers
- Handbook of Automated Reasoning
- 2001

- Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
- TYPES
- 2000

In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructive) algebraic hierarchy of groups, rings, fields, etcetera. For the reals we have then defined the notion of real number structure, which is basically a Cauchy complete Archimedean ordered… (More)

- Luís Cruz-Filipe, Herman Geuvers, Freek Wiedijk
- MKM
- 2004

We present C-CoRN, the Constructive Coq Repository at Nijmegen. It consists of a library of constructive algebra and analysis, formalized in the theorem prover Coq. In this paper we explain the structure, the contents and the use of the library. Moreover we discuss the motivation and the (possible) applications of such a library.

- Herman Geuvers
- TYPES
- 1994

- Roel Bloo, Herman Geuvers
- 1995

Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and AnaJysis of<lb>Dynamic Leader Election Protocols<lb>in Broadcast Networks, p. 73. A generaJ conservative extension theorem in process algebra, p. 17.<lb>Job Shop Scheduling by Constraint Satisfaction, p. 22. A HierarchicaJ Membership Protocol for Synchronous<lb>Distributed… (More)

- Herman Geuvers, Milad Niqui
- TYPES
- 2000

We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamental Theorem of Algebra) project, carried out at Nijmegen University. The aim of this work is to show that these axioms can be satisfied, by constructing a model for them. Apart from… (More)

- Roel Bloo, Herman Geuvers
- Theor. Comput. Sci.
- 1999

We use the Recursive Path Ordering (RPO) technique of semantic labelling to show the Preservation of Strong Normalization (PSN) property for several calculi of explicit substitution. Preservation of Strong Normalization states that if a term M is strongly normalizing under ordinary-reduction (using`global' substitutions), then it is strongly normalizing if… (More)

- Herman Geuvers, Randy Pollack, Freek Wiedijk, Jan Zwanenburg
- J. Symb. Comput.
- 2002

We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof of the Fundamental Theorem of Algebra has been formalized in Coq. The algebraic hierarchy that is described here is both abstract and structured. Structures like groups and rings… (More)