Variable abstraction in O(n log n) space

DOI10.1016/0020-0190(87)90161-XzbMath0622.03011MaRDI QIDQ1090671

J. R. Kennaway, M. R. Sleep

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

complexityfunctional programminglambda calculusdirector stringsTurner combinatorvariable abstraction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items (4)

A fast algorithm for translating combinator expressions with BC-chains ⋮ Some improvements to Turner's algorithm for bracket abstraction ⋮ Unnamed Item ⋮ Efficient multi-variate abstraction using an array representation for combinators.

Cites Work

• Translation of Turner combinators in O(n log n) space
• A linear space translation of functional programs to Turner combinators
• Director strings as combinators
• A new implementation technique for applicative languages
• Another algorithm for bracket abstraction

This page was built for publication: Variable abstraction in O(n log n) space