Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a pseudo-linear type ...

Composite structures are combinations of different primitive data structures or types. ... This hierarchical, recursive structure is common in file systems, UI component trees, and ...

+ Head recursion: when a recursive function is the first call of a block (following the conditional statement). Tail and head recursion, with only one recursive call, are termed _linear recursions_.

Recursion Over Lists and Other Data Structures [ This section is a little out of place--need to introduce type and equality predicates first! Those have been presented in class, so this should be ...

This library has begun with the goal of enriching the area of applicability of recursion schemes in Haskell to be able to handle mutual recursion and DAG-like (or graph-like) data structures. Its ...