Parser combinators are a middle ground between the fine control of hand-rolled parsers and
the high-level almost grammar-like appearance of parsers created via parser generators …

The past decades have witnessed an extensive study of structured recursion schemes. A
general scheme is the hylomorphism, which captures the essence of divide-and-conquer: a …

Structured recursion schemes have been widely used in constructing, optimizing, and
reasoning about programs over inductive and coinductive datatypes. Their plain forms …

Folds and unfolds have been understood as fundamental building blocks for total
programming, and have been extended to form an entire zoo of specialised structured …

Abstract The Human Accelerated Region 1 (HAR1) is the most rapidly evolving region in the
human genome. It is part of two overlapping long non-coding RNAs, has a length of only 118 …

This paper presents the design of the Om language and an implementation of its type
checker and bytecode extractor to Erlang. Om is an intermediate language based on a pure …

Dynamic programming is a well‐known algorithmic technique that solves problems by a
combination of dividing a problem into subproblems and using memoization to avoid an …

The past decades have witnessed an extensive study of structured recursion schemes. A
general scheme is the hylomorphism, which captures the essence of divide-and-conquer: a …

We study schemes for creating canned recursion using category theory. We present an
overview of different types of recursion including,(co) iteration, primitive recursion and …

Abstract (EN) Chimpanzee is the closest living species to modern humans. Although the
differences in phenotype are striking between these two species, the difference in genomic …