Translation of Turner Combinators in O(n log n) Space
暂无分享,去创建一个
Abstract A practical method for representing Turner Combinators is presented, which needs only O(n log n) space in the worst case for translating lambda expressions of length n. No precomputation is necessary in our translation, which should be contrasted with Burton's proposal. The runtime system can be implemented with virtually no essential change to Turner's reduction machine.
[1] D. A. Turner. Another Algorithm for Bracket Abstraction , 1979, J. Symb. Log..
[2] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..
[3] S. Kamal Abdali,et al. An abstraction algorithm for combinatory logic , 1976, Journal of Symbolic Logic.
[4] F. Warren Burton. A Linear Space Translation of Functional Programs to Turner Combinators , 1982, Inf. Process. Lett..