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...
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new reļ¬nements of the dependen...
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
ā This work presents a statistical field study of the availability of time sources for location in a true wireless network. Terrestrial (base stations) and satellite (GPS) source...
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ā¤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...