A fast algorithm for translating combinator expressions with BC-chains
From MaRDI portal
Publication:1096387
DOI10.1007/BF03037465zbMath0633.68025OpenAlexW2045428044MaRDI QIDQ1096387
Publication date: 1987
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03037465
fast algorithmfunctional programmingabstraction algorithmlambda expressionscombinator trees with BC-chains
Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Translation of Turner combinators in O(n log n) space
- The BC-chain method for representing combinators in linear space
- Variable abstraction in O(n log n) space
- On recognizing graph properties from adjacency matrices
- A linear space translation of functional programs to Turner combinators
- Another algorithm for bracket abstraction