Translation of Turner combinators in O(n log n) space
From MaRDI portal
(Redirected from Publication:802308)
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.
Recommendations
Cites work
Cited in
(7)- The BC-chain method for representing combinators in linear space
- Variable abstraction in O(n log n) space
- A fast algorithm for translating combinator expressions with BC-chains
- A set of combinators for abstraction in linear space
- Extending SMT solvers to higher-order logic
- scientific article; zbMATH DE number 3905831 (Why is no real title available?)
- scientific article; zbMATH DE number 3909738 (Why is no real title available?)
This page was built for publication: Translation of Turner combinators in O(n log n) space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802308)