A set of combinators for abstraction in linear space
From MaRDI portal
Publication:1821553
DOI10.1016/0020-0190(87)90183-9zbMath0616.68006OpenAlexW1998008830MaRDI QIDQ1821553
M.-H. Durand, M. Castan, Michel Lemaître
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90183-9
complexityfunctional programmingreduction machinecombinator codecombinator expressionindexed combinatorslinear abstraction algorithm
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)
Cites Work
- Translation of Turner combinators in O(n log n) space
- The BC-chain method for representing combinators in linear space
- A linear space translation of functional programs to Turner combinators
- An abstraction algorithm for combinatory logic
- A new implementation technique for applicative languages
- Another algorithm for bracket abstraction
- Unnamed Item
- Unnamed Item
This page was built for publication: A set of combinators for abstraction in linear space