The main way of analysing the complexity of a program is that of extracting and solving a
recurrence that expresses its running time in terms of the size of its input. We develop a …

A typical way of analyzing the time complexity of functional programs is to extract a
recurrence expressing the running time of the program in terms of the size of its input, and …

This paper develops machinery necessary to mechanically import arbitrary functional
programs into Coq's type theory, manually strengthen their specifications with additional …

In this paper we explain how recursion operators can be used to structure and reason about
program semantics within a functional language. In particular, we show how the recursion …

This paper presents a novel type-and-effect analysis for predicting upper-bounds on
memory allocation costs for co-recursive definitions in a simple lazily-evaluated functional …

Functional languages are considered useful in part because their applicative structure
makes it easier to reason about the value returned by a program (its extensional behavior) …

A central method for analyzing the asymptotic complexity of a functional program is to extract
and then solve a recurrence that expresses evaluation cost in terms of input size. The …

The worker/wrapper transformation is a general technique for improving the performance of
recursive programs by changing their types. The previous formalisation (A. Gill & G. Hutton …

In this paper we introduce a restrictive version of the multiset path order, called polynomial
path order. This recursive path order induces polynomial bounds on the maximal number of …

Procedural abstraction is an important concept for functional and imperative programming
as well. Compilers should implement procedures and calls as efficient as possible. This …