154 search results - page 6 / 31 » Cobham recursive set functions |
TPHOL
2003
IEEE
14 years 27 days ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
TCS
2008
13 years 7 months ago
2008
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. Distributed Objects DO as de ned by OMG's CORBA architecture provide a model for object-oriented parallel distributed computing. The parallelism in this model howeve...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
COCO
1992
Springer
13 years 11 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...