Rob Nederpelt

Affiliations:
  • Eindhoven University of Technology, Netherlands


According to our database1, Rob Nederpelt authored at least 24 papers between 1973 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Characteristics of de Bruijn's early proof checker Automath.
Fundam. Informaticae, 2022

2012
A History of Types<sup>*</sup>.
Proceedings of the Logic: A History of its Central Concepts, 2012

2004
A Refinement of de Bruijn's Formal Language of Mathematics.
J. Log. Lang. Inf., 2004

Rewriting for Fitch Style Natural Deductions.
Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

A Path to Faithful Formalizations of Mathematics.
Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004

2003
Revisiting the notion of function.
J. Log. Algebraic Methods Program., 2003

Automath and Pure Type Systems.
Proceedings of the Mathematics, 2003

Faithfully Reflecting the Structure of Informal Mathematical Proofs into Formal Type Theories.
Proceedings of the Mathematical Knowledge Management Symposium, 2003

2002
Formalizing Belief Revision in Type Theory.
Log. J. IGPL, 2002

Types in logic and mathematics before 1940.
Bull. Symb. Log., 2002

Parameters in Pure Type Systems.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
De Bruijn's Syntax and Reductional Equivalence of Lambda-Terms.
Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001

Refining the Barendregt Cube Using Parameters.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

1999
On Pi-Conversion in the lambda-Cube and the Combination with Abbreviations.
Ann. Pure Appl. Log., 1999

1998
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions.
Acta Informatica, 1998

1996
A Useful lambda-Notation.
Theor. Comput. Sci., 1996

A modern elaboration of the ramified theory of types.
Stud Logica, 1996

Canonical Typing and Pi-Conversion in the Barendregt Cube.
J. Funct. Program., 1996

The Barendregt Cube with Definitions and Generalised Reduction.
Inf. Comput., 1996

1995
Refining Reduction in the Lambda Calculus.
J. Funct. Program., 1995

1994
A Unified Approach to Type Theory Through a Refined lambda-Calculus.
Theor. Comput. Sci., 1994

1993
On Stepwise Explicit Substitution.
Int. J. Found. Comput. Sci., 1993

1980
An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus.
Proceedings of the 5th Conference on Automated Deduction, 1980

1973
Strong normalization in a typed lambda calculus with lambda structured types.
PhD thesis, 1973


  Loading...