A set of combinators for abstraction in linear space
From MaRDI portal
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.
Recommendations
Cites work
- A linear space translation of functional programs to Turner combinators
- A new implementation technique for applicative languages
- An abstraction algorithm for combinatory logic
- Another algorithm for bracket abstraction
- scientific article; zbMATH DE number 3941502 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- The BC-chain method for representing combinators in linear space
- Translation of Turner combinators in O(n log n) space
Cited in
(4)
This page was built for publication: A set of combinators for abstraction in linear space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821553)