tailr v0.1.2

0

Monthly downloads

0th

Percentile

Automatic Tail Recursion Optimisation

Implements meta-programming functions for automatically translating recursive functions into looping functions or trampolines.

Readme

tailr – Tail recursion optimisations for R programming

Licence lifecycle Project Status: Active – The project has reached a stable, usable
state and is being actively
developed. Last-changedate packageversion

Travis build
status Appveyor build
status Coverage
status Coverage
status

CRAN
status CRAN
downloads minimal R
version


Recursive functions are the natural way to express iterations in a functional programming langauge, but in R, they can be significantly slower than loop-versions and for moderately long sequences or moderately deep trees, recursive functions will reach a limit imposted on them by the stack limit.

There are known solutions to these problems, as long as functions are written to be tail-recursive, meaning that the return value of a function is either a base value or another recursive call, but where we do not call recursively to then do something with the result.

The goal of tailr is to automatically transform tail-recursive functions into loops or trampolines.

Installation

You can install the released version of tailr from CRAN using

install.packages("tailr")

You can install tailr from GitHub with:

# install.packages("devtools")
devtools::install_github("mailund/tailr")

Examples

We can take a classical recursive function and write it in a tail-recursive form using an accumulator:

factorial <- function(n, acc = 1) {
    if (n <= 1) acc
    else factorial(n - 1, acc * n)
}

We can then, automatically, translate that into a looping version:

tr_factorial <- tailr::loop_transform(factorial, byte_compile = FALSE)
tr_factorial
#> function(n, acc = 1) {
#>     if (n <= 1) acc
#>     else factorial(n - 1, acc * n)
#> }

tr_factorial(100)
#> [1] 9.332622e+157

I have disabled byte compilation to make running time comparisons fair; by default it is enabled. For a function as simple as factorial, though, byte compiling will not affect the running time in any substantial amount.

We can compare the running time with the recursive function and a version that is written using a loop:

loop_factorial <- function(n) {
    val <- 1
    while (n > 1) {
        val <- n * val
        n <- n - 1
    }
    val
}


n <- 1000
bm <- microbenchmark::microbenchmark(factorial(n), 
                                     loop_factorial(n), 
                                     tr_factorial(n))
bm
#> Unit: microseconds
#>               expr     min       lq      mean   median       uq      max
#>       factorial(n) 715.304 772.4265 1035.9802 863.2585 1179.665 6816.073
#>  loop_factorial(n)  51.310  51.8860   96.7987  53.6600   60.598 3491.843
#>    tr_factorial(n) 791.451 821.8215 1100.5864 907.5140 1166.180 2606.855
#>  neval
#>    100
#>    100
#>    100
boxplot(bm)

There is some overhead in using the automatically translated version over the hand-written, naturally, and for a simple function such as factorial, it is not hard to write the loop-variant instead of the recursive function.

However, consider a more complicated example. Using the pmatch package, we can create a linked list data structure as this:

library(pmatch)
llist := NIL | CONS(car, cdr : llist)

A natural way to process linked lists using pattern matching is to write recursive functions that matches different patterns of their input. A function for computing the length of a linked list can look like this:

llength <- function(llist, acc = 0) {
    cases(llist,
          NIL -> acc,
          CONS(car, cdr) -> llength(cdr, acc + 1))
}

It is reasonably simple to understand this function, whereas a looping version is somewhat more complicated. An initial attempt could look like this:

loop_llength <- function(llist) {
    acc <- 0
    repeat {
        cases(llist,
              NIL -> return(acc),
              CONS(car, cdr) -> {
                  acc <- acc + 1
                  llist <- cdr
              })
    }
}

This version will not function, however, since it tries to return from inside a call to cases, and return only works inside the immediate scope.

Instead, we can use callCC to implement a non-local return like this:

loop_llength <- function(llist) {
    callCC(function(escape) {
        acc <- 0
        repeat {
            cases(llist,
                  NIL -> escape(acc),
                  CONS(car, cdr) -> {
                      acc <<- acc + 1
                      llist <<- cdr
                  })
        }    
    })
}

Notice that we have to use the <<- assignment operator here. This is for the same reason that we need a non-local return. The expression inside the call to cases is evaluated in a different environment than the local function environment, so to get to the actual variables we want to assign to, we need the non-local assignment operator.

It is possible to avoid cases using other functions from the pmatch package, but the result is vastly more compliated since pattern matching and expressions that should be evaluated per case needs to handle scoping. We can automatically make such a function using tailr, however:

tr_llength <- tailr::loop_transform(llength)

The function we generate is rather complicated

tr_llength
#> function(llist, acc = 0) {
#>     cases(llist,
#>           NIL -> acc,
#>           CONS(car, cdr) -> llength(cdr, acc + 1))
#> }
#> <bytecode: 0x7fac8a3e9238>

but, then, it is not one we want to manually inspect in any case.

The automatically generated function is complicated, but it actually outcompetes the hand-written loop version.

make_llist <- function(n) {
    l <- NIL
    for (i in 1:n) {
        l <- CONS(i, l)
    }
    l
}
test_llist <- make_llist(100)
bm <- microbenchmark::microbenchmark(llength(test_llist),
                                     loop_llength(test_llist),
                                     tr_llength(test_llist))
bm
#> Unit: milliseconds
#>                      expr      min       lq     mean   median       uq
#>       llength(test_llist) 54.94337 65.40173 68.42609 67.61124 71.20118
#>  loop_llength(test_llist) 59.18011 70.31971 75.76034 74.02095 78.67105
#>    tr_llength(test_llist) 35.13879 43.11308 45.63485 45.09175 48.55855
#>        max neval
#>   99.00812   100
#>  134.51344   100
#>   60.88526   100
boxplot(bm)

It is, of course, possible to write a faster hand-written function to deal with this case, but it will be about as complicated as the automatically generated function, and you don’t really want to write that by hand.

As you have no doubt noticed about llength, it is not in fact tail-recursive, from the look of it, since the final recursion is enclosed by a call to cases. The function is only tail-recursive because it can be translated into one by rewriting the cases function call to a sequence of if-statements. The tailr package doesn’t handle cases from pmatch by knowing about this package. Instead, it has a mechanism that lets you provide re-writing rules.

If you set the attribute “tailr_transform” on a function, and set this attribute to a function, then that function will be called when tailr sees the function, before it attempts any other processing. The attribute must be a function that maps an expression to another, re-written, expression. The one for cases looks like this:

tailr_transform_call <- function(expr) {
    stopifnot(rlang::call_name(expr) == "cases")

    args <- rlang::call_args(expr)
    value <- args[[1]]
    patterns <- args[-1]
    eval(rlang::expr(cases_expr(!!value, !!!patterns)))
}
attr(cases, "tailr_transform") <- tailr_transform_call

You can use this mechanism to support tail-recursion for non-tail-recursive functions that can be rewritten to be tail-recursive.

Functions in tailr

Name Description
make_returns_explicit_call Make exit points into explicit calls to return.
user_transform_rec Apply user transformations depths-first.
translate_recursive_call Translate a return(<recursive-function-call>) expressions into a block that assigns the parameters to local variables and call next.
build_transformed_function Construct the expression for a transformed function body.
user_transform Apply user transformations depths-first.
can_call_be_transformed Tests if a call object can be transformed.
simplify_nested_blocks Simplify nested code-blocks.
returns_to_escapes_call Make calls to return into calls to escapes.
can_transform_rec Recursive call for testing if an expression can be transformed into a looping tail-recursion.
returns_to_escapes Make calls to return into calls to escapes.
handle_recursive_returns_call Handles the actual recursive returns
can_loop_transform_body Tests if a function, provided by its name, can be transformed.
loop_transform Transform a function from recursive to looping.
make_returns_explicit Make exit points into explicit calls to return.
handle_recursive_returns Handle the actual recursive calls
simplify_returns_call Removes return(return(...)) cases.
simplify_returns Remove return(return(...)) expressions
No Results!

Last month downloads

Details

License GPL-3
Encoding UTF-8
Language en-GB
LazyData true
ByteCompile true
RoxygenNote 6.0.1
URL https://github.com/mailund/tailr
BugReports https://github.com/mailund/tailr/issues
NeedsCompilation no
Packaged 2018-04-27 07:45:23 UTC; mailund
Repository CRAN
Date/Publication 2018-04-27 07:54:53 UTC

Include our badge in your README

[![Rdoc](http://www.rdocumentation.org/badges/version/tailr)](http://www.rdocumentation.org/packages/tailr)