Lazy variable-renumbering makes substitution cheap (Q1114386): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90114-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042936502 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3886868 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692880 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:36, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lazy variable-renumbering makes substitution cheap |
scientific article |
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
