Sciweavers

429 search results - page 77 / 86
» Polymorphic typed defunctionalization
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
TACS
1994
Springer
13 years 11 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi
POPL
2010
ACM
14 years 5 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, ...
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
14 years 1 months ago
Exploring relationships between genotype and oral cancer development through XCS
In medical research, being able to justify decisions is generally as important as taking the right ones. Interpretability is then one of the chief characteristics a learning algor...
Alessandro Passaro, Flavio Baronti, Valentina Magg...
BMCBI
2006
116views more  BMCBI 2006»
13 years 7 months ago
A model-based approach to selection of tag SNPs
Background: Single Nucleotide Polymorphisms (SNPs) are the most common type of polymorphisms found in the human genome. Effective genetic association studies require the identific...
Pierre Nicolas, Fengzhu Sun, Lei M. Li