This paper presents an approach to elimination of Type-3 code clones based on generative techniques. At a first step it is shown how to replace Type-3 clones by higher-order functions. Then this approach is further generalized by utilizing generative designs.

In this paper we study diierent kinds of reductions of data types. By reduction we mean applying the higher order function fold to a data structure. An appropriate fold function can be deened for any recursive data type. These reductions have been presented as homomorphisms by several authors 2, 6]. Although many useful functions on data structures can be programmed as instances of fold, there ...

Waveguide QED with cold atoms provides a potent platform for the study of non-equilibrium, many-body, and open-system quantum dynamics. Even weak coupling strong photon loss, collective enhancement light-atom interactions leads to correlations photons arising in transmission, as shown recent experiments. Here we apply an improved mean-field theory based on higher-order cumulant expansions descr...

The calculus of Dependent Object Types (DOT) has enabled a more principled and robust implementation Scala, but its support for type-level computation proven insufficient. As remedy, we propose $F^\omega_{..}$, rigorous theoretical foundation Scala's higher-kinded types. $F^\omega_{..}$ extends $F^\omega_{<:}$ with interval kinds, which afford unified treatment important type- kind-level abstra...