A set of combinators for abstraction in linear space (Q1821553)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A set of combinators for abstraction in linear space |
scientific article; zbMATH DE number 3999253
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A set of combinators for abstraction in linear space |
scientific article; zbMATH DE number 3999253 |
Statements
A set of combinators for abstraction in linear space (English)
0 references
1987
0 references
A set of simple indexed combinators and an associated linear abstraction algorithm are presented, allowing to translate a combinator expression into a combinator code containing no variables, in such a way that the length of the generated code is less than twice the length of the original expression in the usual case. The key idea of this algorithm is to operate globally on all variables during the whole abstraction process. This set of combinators is intended for practical use as a reduction machine instruction set.
0 references
functional programming
0 references
complexity
0 references
indexed combinators
0 references
linear abstraction algorithm
0 references
combinator expression
0 references
combinator code
0 references
reduction machine
0 references
