A fast algorithm is presented for translating lambda expressions to combinator trees with BC-chains. The time complexity of this algorithm is O (n log n) in the worst case, where n is the length of an input expression...
详细信息
A fast algorithm is presented for translating lambda expressions to combinator trees with BC-chains. The time complexity of this algorithm is O (n log n) in the worst case, where n is the length of an input expression. Furthermore it requires only O (n log n) working space. This result achieves a substantial improvement to the previously known algorithm having the quadratic complexity. The basic idea of the algorithm may be applied to practical processing systems, whether they use BC-chains or not.
Categorical combinators have been derived from the study of categorical semantics of lambda calculus, and it has been found that they may be used in implementation of functional languages. In this paper categorical co...
详细信息
Categorical combinators have been derived from the study of categorical semantics of lambda calculus, and it has been found that they may be used in implementation of functional languages. In this paper categorical combinators are extended so that functions with multiple arguments can be directly handled, thus making them more suitable for practical computation. A rewriting system named CCLMβ
暂无评论