A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes Ī...
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehag...
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a ļ¬nite number of its output values. Unifor...
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive deļ¬nitions. The operational semantics is given b...
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
XML transformations are most naturally deļ¬ned as recursive functions on trees. Their direct implementation, however, causes ineļ¬cient memory usage because the input XML tree is...
We describe a new method to represent (partial) recursive functions in type theory. For every recursive deļ¬nition, we deļ¬ne a co-inductive type of prophecies that characterises...
We describe a new method to represent (partial) recursive functions in type theory. For every recursive deļ¬nition, we deļ¬ne a co-inductive type of prophecies that characterises...
We show that reachability and termination for lossy channel systems is exactly at level FĻĻ in the Fast-Growing Hierarchy of recursive functions, the ļ¬rst level that dominates...
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
"This course has two objectives. First (and obvious) is to teach programming.
Second is to present some fundamental principles of computer science,
especially algorithm desi...