Sciweavers

98 search results - page 5 / 20
» Binding-Time Analysis for Polymorphic Types
Sort
View
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
BMCBI
2011
12 years 12 months ago
Wavelet-based identification of DNA focal genomic aberrations from single nucleotide polymorphism arrays
Background: Copy number aberrations (CNAs) are an important molecular signature in cancer initiation, development, and progression. However, these aberrations span a wide range of...
Youngmi Hur, Hyunju Lee
ICFP
2005
ACM
14 years 8 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
PLDI
2012
ACM
11 years 10 months ago
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
Brian Hackett, Shu-yu Guo
JOT
2010
173views more  JOT 2010»
13 years 6 months ago
A Dependence Representation for Coverage Testing of Object-Oriented Programs
Abstract We propose a dependence-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). Apart from structural features...
E. S. F. Najumudheen, Rajib Mall, Debasis Samanta