Lazy variable-renumbering makes substitution cheap (Q1114386)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4082947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lazy variable-renumbering makes substitution cheap |
scientific article; zbMATH DE number 4082947 |
Statements
Lazy variable-renumbering makes substitution cheap (English)
0 references
1988
0 references
A new data structure for expressions with many variable bindings is efficient for symbol manipulation involving repeated complex substitution because it avoids making many trivially different copies. It retains variables, permits efficient alpha- and beta-conversion, and is appropriate for program transformation and formal logic.
0 references
variable capture
0 references
lambda calculus
0 references
De Bruijn number
0 references
data structure
0 references
symbol manipulation
0 references
substitution
0 references
0.7959398
0 references
0.7959398
0 references
0.76519674
0 references
0 references
0 references
0.75528973
0 references
0.7533852
0 references
0 references
