Sciweavers

98 search results - page 14 / 20
» Binding-Time Analysis for Polymorphic Types
Sort
View
126
Voted
ICFP
2006
ACM
16 years 2 months ago
Static analysis for syntax objects
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
David Fisher, Olin Shivers
144
Voted
BMCBI
2011
14 years 6 months ago
Inference of Chromosome-Specific Copy Numbers Using Population Haplotypes
Background: Using microarray and sequencing platforms, a large number of copy number variations (CNVs) have been identified in humans. In practice, because our human genome is a d...
Yao-Ting Huang, Min-Han Wu
206
Voted
POPL
2006
ACM
16 years 3 months ago
A virtual class calculus
Virtual classes are class-valued attributes of objects. Like virtual methods, virtual classes are defined in an object's class and may be redefined within subclasses. They re...
Erik Ernst, Klaus Ostermann, William R. Cook
142
Voted
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
15 years 7 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape
179
Voted
POPL
1994
ACM
15 years 6 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen