Sciweavers

3670 search results - page 117 / 734
» Linear Recursive Functions
Sort
View
PLPV
2009
ACM
16 years 1 months ago
Embedding a logical theory of constructions in Agda
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
Ana Bove, Peter Dybjer, Andrés Sicard-Ram&i...
TOOLS
2008
IEEE
15 years 11 months ago
The Meta in Meta-object Architectures
Abstract. Behavioral reflection is crucial to support for example functional upgrades, on-the-fly debugging, or monitoring critical applications. However the use of reflective f...
Marcus Denker, Mathieu Suen, Stéphane Ducas...
CSL
2008
Springer
15 years 6 months ago
Type-Based Termination with Sized Products
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
Gilles Barthe, Benjamin Grégoire, Colin Rib...
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
15 years 11 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
CEC
2005
IEEE
15 years 10 months ago
XCS with computed prediction for the learning of Boolean functions
Computed prediction represents a major shift in learning classifier system research. XCS with computed prediction, based on linear approximators, has been applied so far to functi...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...