The following pages link to Rob Nederpelt (Q740480):
Displayed 26 items.
- N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
- Dijkstra-Scholten predicate calculus: Concepts and misconceptions (Q1284701) (← links)
- On \(\Pi\)-conversion in the \(\lambda\)-cube and the combination with abbreviations (Q1302298) (← links)
- A unified approach to type theory through a refined \(\lambda\)-calculus (Q1349674) (← links)
- A useful \(\lambda\)-notation (Q1365680) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- A refinement of de Bruijn's formal language of mathematics (Q1876109) (← links)
- A modern perspective on type theory. From its origins until today (Q1887432) (← links)
- The Barendregt cube with definitions and generalised reduction (Q1917101) (← links)
- N. G. de Bruijn (1918--2012) and his road to Automath, the earliest proof checker (Q1935352) (← links)
- A modern elaboration of the ramified theory of types (Q2563450) (← links)
- (Q2763649) (← links)
- Type Theory and Formal Proof (Q2925448) (← links)
- (Q3044340) (← links)
- Types in Logic and Mathematics before 1940 (Q3149961) (← links)
- (Q3376918) (← links)
- ON STEPWISE EXPLICIT SUBSTITUTION (Q4286110) (← links)
- (Q4664921) (← links)
- Formalizing Belief Revision in Type Theory (Q4795878) (← links)
- Refining reduction in the lambda calculus (Q4880488) (← links)
- Canonical typing and ∏-conversion in the Barendregt Cube (Q4895552) (← links)
- Automath and Pure Type Systems (Q4924545) (← links)
- Characteristics of de Bruijn’s early proof checker Automath (Q5089679) (← links)
- Mathematical Knowledge Management (Q5313054) (← links)
- Rewriting Techniques and Applications (Q5901566) (← links)
- Characteristics of de Bruijn's early proof checker Automath (Q6392607) (← links)