Rob Nederpelt

According to our database1, Rob Nederpelt
  • authored at least 22 papers between 1980 and 2012.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2012
A History of Types*.
Proceedings of the Logic: A History of its Central Concepts, 2012

2004
A Refinement of de Bruijn's Formal Language of Mathematics.
Journal of Logic, Language and Information, 2004

Faithfully Reflecting the Structure of Informal Mathematical Proofs into Formal Type Theories.
Electr. Notes Theor. Comput. Sci., 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. Algebr. Program., 2003

Automath and Pure Type Systems.
Electr. Notes Theor. Comput. Sci., 2003

2002
Formalizing Belief Revision in Type Theory.
Logic Journal of the IGPL, 2002

Types in logic and mathematics before 1940.
Bulletin of Symbolic Logic, 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. Logic, 1999

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

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

A modern elaboration of the ramified theory of types.
Studia 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


  Loading...