Considerations from category theory described in [1] have permitted to add new rewriting rules for optimal reductions of the λ-calculus [19, 14]. These rules produce an impressive improvement in the performance of the reduction system, and provide a first step towards the solution of the well known and crucial problem of accumulation of control operators. In this paper, after an introduction to optimal reductions, we exhibit the aforementioned problem and prove the correctness of the new rules.
['Andrea Asperti', 'Juliusz Chroboczek']
Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations - Optimizing Optimal lambda-Calculus Implementations.