Sciweavers

COLT
2001
Springer
13 years 9 months ago
Robust Learning - Rich and Poor
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...
COLT
2001
Springer
13 years 9 months ago
On the Synthesis of Strategies Identifying Recursive Functions
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...
Sandra Zilles
TPHOL
2002
IEEE
13 years 9 months ago
Type-Theoretic Functional Semantics
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...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman
TLCA
2005
Springer
13 years 10 months ago
Recursive Functions with Higher Order Domains
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...
Ana Bove, Venanzio Capretta
APLAS
2006
ACM
13 years 10 months ago
A Pushdown Machine for Recursive XML Processing
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...
Keisuke Nakano, Shin-Cheng Mu
TLCA
2007
Springer
13 years 10 months ago
Computation by Prophecy
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...
Ana Bove, Venanzio Capretta
TPHOL
2008
IEEE
13 years 11 months ago
A Type of Partial Recursive Functions
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...
Ana Bove, Venanzio Capretta
LICS
2008
IEEE
13 years 11 months ago
The Ordinal Recursive Complexity of Lossy Channel Systems
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...
Pierre Chambart, Ph. Schnoebelen
ALT
2003
Springer
14 years 1 months ago
Intrinsic Complexity of Uniform Learning
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...
Sandra Zilles

Lecture Notes
700views
15 years 2 months ago
Foundations of Computer Science
"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...
Lawrence C Paulson