207 search results - page 16 / 42 » Elementary Strong Functional Programming |
POPL
2001
ACM
14 years 8 months ago
2001
ACM
By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing ...
ICALP
2001
Springer
14 years 5 days ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
ENTCS
2010
13 years 5 months ago
2010
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
While support vector machines (SVMs) have shown great promise in supervised classification problems, researchers have had to rely on expert domain knowledge when choosing the SVM&...