English Abstract: Kenya is a frontier market for ‘financial technology’, or FinTech. This industry – which merges mobile telephony and digital data with commercial lending has grown spectacularly, millions of Kenyans borrowing household, emergency, expenses. industry’s frenzied growth been fuelled by not merely the pursuit profit, but also decidedly more developmental aspiration, namely inclusi...

Gold’s original paper on inductive inference introduced a notion of an optimal learner . Intuitively, a learner identifies a class of objects optimally iff there is no other learner that: requires as little of each presentation of each object in the class in order to identify that object, and, for some presentation of some object in the class, requires less of that presentation in order to iden...

We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as finite-state process descriptions. We use as algorithmic description language Pidgin ML, a core applicative subset of Objective Caml. Dedicated to Zohar Manna for his 2th birthday

In this paper we present how refactoring of object-oriented programs can be accomplished by using refinement. Our approach is based on algebraic laws of an object-oriented language for refinement similar to Java. We follow a strategy involving data and algorithmic refinement of classes.

This paper proposes a pattern called GIG, a generic interface graph which deals with definition and control of processes taking into account some specific requirements of simplicity, easiness of definition from algorithmic natural language and flexibility in the granularity of defined processes. The pattern is intended to help the design and reuse of programs.

This paper presents a pattern called GIG, a generic interface graph which deals with definition and control of processes taking into account some specific requirements of simplicity, easiness of definition from algorithmic language and flexibility in the granularity of defined processes. The pattern is intended to help the design and reuse of programs.

Structured Audio (SA) is an MPEG 4 Audio standard for algorithmic sound encoding, using the programming language SAOL. The paper describes a SA decoder, sfront, that translates a SAOL program into a C program, which is then compiled and executed to create audio. Performance data shows a 7.6x to 20.4x speedup compared to the SA reference MPEG decoder.

We aim for composing algorithmic music in an interactive way with multiple participants. To this end we have developed an interpreter for a sublanguage of the non-strict functional programming language Haskell that allows the modification of a program during its execution. Our system can be used both for musical live-coding and for demonstration and education of functional programming.

This paper introduces a method for algorithmic reduction of the search space of an ILP task, omitting the need for explicit language bias. It relies on bottom-up propositionalisation of examples and background knowledge. A proof of concept has been developed for observational learning of stratified normal logic programs.