In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...
Martin Bravenboer, Rob Vermaas, Jurgen J. Vinju, E...
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discoveri...