Sciweavers

3001 search results - page 262 / 601
» Recursive type generativity
Sort
View
ICFP
2005
ACM
16 years 6 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
POPL
2010
ACM
16 years 3 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
ALT
2004
Springer
16 years 3 months ago
Learning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
Sanjay Jain, Efim B. Kinber
BIBE
2007
IEEE
162views Bioinformatics» more  BIBE 2007»
16 years 26 days ago
An Investigation into the Feasibility of Detecting Microscopic Disease Using Machine Learning
— The prognosis for many cancers could be improved dramatically if they could be detected while still at the microscopic disease stage. We are investigating the possibility of de...
Mary Qu Yang, Jack Y. Yang
PLDI
2005
ACM
16 years 2 days ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve