Mathematical logic and foundations Concept
De Bruijn index
Summary
De Bruijn indices write terms of the lambda calculus without names for bound variables. Each bound occurrence of a variable is replaced by a natural number that counts the abstractions between the occurrence and its binder. Two terms that differ only by renaming of bound variables then become literally the same. Nicolaas Govert de Bruijn introduced them in 1972, and they are widely used in proof assistants and compilers.
Further reading
About this page
| Tag | 1TC37YHZPE |
|---|---|
| URI | m2://1TC37YHZPE |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B40, 68N18 |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.