Affiliation:
1. Microsoft Research, USA
2. University of Edinburgh, UK
Abstract
The tail-recursion moduloconstransformation can rewrite functions that are not quite tail-recursive into a tail-recursive form that can be executed efficiently. In this article we generalize tail recursion modulocons(TRMc) to modulocontexts(TRMC), and calculate a general TRMC algorithm from its specification. We can instantiate our general algorithm by providing an implementation of application and composition on abstract contexts, and showing that ourcontextlaws_ hold. We provide some known instantiations of TRMC, namely moduloevaluation contexts(CPS), andassociative operations, and further instantiantions not so commonly associated with TRMC, such asdefunctionalizedevaluation contexts,monoids,semirings,exponents, andcons products. We study the moduloconsinstantiation in particular and prove that an instantiation using Minamide’s hole calculus is sound. We also calculate a second instantiation in terms of the Perceus heap semantics to precisely reason about the soundness of in-place update. While all previous approaches to TRMc fail in the presence of non-linear control (for example induced by call/cc, shift/reset or algebraic effect handlers), we can elegantly extend the heap semantics to a hybrid approach which dynamically adapts to non-linear control flow. We have a full implementation of hybrid TRMc in the Koka language and our benchmark shows the TRMc transformed functions are always as fast or faster than using manual alternatives.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference52 articles.
1. Compiling with Continuations
2. Type-driven defunctionalization
3. The promotion and accumulation strategies in transformational programming
4. Joshua Bloch . 2008. Effective Java ( 2 nd Edition) (The Java Series) (2 ed.). Prentice Hall PTR , USA. isbn:0321356683 https://doi.org/10.5555/1377533 10.5555/1377533 Joshua Bloch. 2008. Effective Java (2nd Edition) (The Java Series) (2 ed.). Prentice Hall PTR, USA. isbn:0321356683 https://doi.org/10.5555/1377533
5. Frédéric Bour Basile Clément and Gabriel Scherer. 2021. Tail Modulo Cons. Journeées Francophones des Langages Applicatifs (JFLA) April https://hal.inria.fr/hal-03146495/document hal-03146495. Frédéric Bour Basile Clément and Gabriel Scherer. 2021. Tail Modulo Cons. Journeées Francophones des Langages Applicatifs (JFLA) April https://hal.inria.fr/hal-03146495/document hal-03146495.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. FP²: Fully in-Place Functional Programming;Proceedings of the ACM on Programming Languages;2023-08-30
2. Tail Recursion Modulo Context: An Equational Approach;Proceedings of the ACM on Programming Languages;2023-01-09