| 2004 |
|---|
| 21 | EE | Gueorgui I. Jojgov,
Rob Nederpelt:
A Path to Faithful Formalizations of Mathematics.
MKM 2004: 145-159 |
| 20 | EE | Herman Geuvers,
Rob Nederpelt:
Rewriting for Fitch Style Natural Deductions.
RTA 2004: 134-154 |
| 19 | EE | Gueorgui I. Jojgov,
Rob Nederpelt,
M. Scheffer:
Faithfully Reflecting the Structure of Informal Mathematical Proofs into Formal Type Theories.
Electr. Notes Theor. Comput. Sci. 93: 102-117 (2004) |
| 18 | EE | Fairouz Kamareddine,
Rob Nederpelt:
A Refinement of de Bruijn's Formal Language of Mathematics.
Journal of Logic, Language and Information 13(3): 287-340 (2004) |
| 2003 |
|---|
| 17 | EE | Fairouz Kamareddine,
Twan Laan,
Rob Nederpelt:
Automath and Pure Type Systems.
Electr. Notes Theor. Comput. Sci. 85(7): (2003) |
| 16 | EE | Fairouz Kamareddine,
Twan Laan,
Rob Nederpelt:
Revisiting the notion of function.
J. Log. Algebr. Program. 54(1-2): 65-107 (2003) |
| 2002 |
|---|
| 15 | EE | Roel Bloo,
Fairouz Kamareddine,
Twan Laan,
Rob Nederpelt:
Parameters in Pure Type Systems.
LATIN 2002: 371-385 |
| 14 | EE | Fairouz Kamareddine,
Twan Laan,
Rob Nederpelt:
Types in logic and mathematics before 1940.
Bulletin of Symbolic Logic 8(2): 185-245 (2002) |
| 13 | EE | Tijn Borghuis,
Fairouz Kamareddine,
Rob Nederpelt:
Formalizing Belief Revision in Type Theory.
Logic Journal of the IGPL 10(5): 461-500 (2002) |
| 2001 |
|---|
| 12 | EE | Fairouz Kamareddine,
Twan Laan,
Rob Nederpelt:
Refining the Barendregt Cube Using Parameters.
FLOPS 2001: 375-390 |
| 11 | | Fairouz Kamareddine,
Roel Bloo,
Rob Nederpelt:
De Bruijn's Syntax and Reductional Equivalence of Lambda-Terms.
PPDP 2001: 16-27 |
| 1999 |
|---|
| 10 | | Fairouz Kamareddine,
Roel Bloo,
Rob Nederpelt:
On Pi-Conversion in the lambda-Cube and the Combination with Abbreviations.
Ann. Pure Appl. Logic 97(1-3): 27-45 (1999) |
| 1998 |
|---|
| 9 | EE | Lex Bijlsma,
Rob Nederpelt:
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions.
Acta Inf. 35(12): 1007-1036 (1998) |
| 1996 |
|---|
| 8 | | Roel Bloo,
Fairouz Kamareddine,
Rob Nederpelt:
The Barendregt Cube with Definitions and Generalised Reduction.
Inf. Comput. 126(2): 123-143 (1996) |
| 7 | | Fairouz Kamareddine,
Rob Nederpelt:
Canonical Typing and Pi-Conversion in the Barendregt Cube.
J. Funct. Program. 6(2): 245-267 (1996) |
| 6 | | Twan Laan,
Rob Nederpelt:
A modern elaboration of the ramified theory of types.
Studia Logica 57(2/3): 243-278 (1996) |
| 5 | EE | Fairouz Kamareddine,
Rob Nederpelt:
A Useful lambda-Notation.
Theor. Comput. Sci. 155(1): 85-109 (1996) |
| 1995 |
|---|
| 4 | | Fairouz Kamareddine,
Rob Nederpelt:
Refining Reduction in the Lambda Calculus.
J. Funct. Program. 5(4): 637-651 (1995) |
| 1994 |
|---|
| 3 | | Fairouz Kamareddine,
Rob Nederpelt:
A Unified Approach to Type Theory Through a Refined lambda-Calculus.
Theor. Comput. Sci. 136(1): 183-216 (1994) |
| 1993 |
|---|
| 2 | | Fairouz Kamareddine,
Rob Nederpelt:
On Stepwise Explicit Substitution.
Int. J. Found. Comput. Sci. 4(3): 197-240 (1993) |
| 1980 |
|---|
| 1 | | Rob Nederpelt:
An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus.
CADE 1980: 182-194 |
