Sciweavers

98 search results - page 2 / 20
» Binding-Time Analysis for Polymorphic Types
Sort
View
PEPM
1994
ACM
13 years 11 months ago
PERs from Projections for Binding-Time Analysis
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
Kei Davis
ESOP
2001
Springer
13 years 12 months ago
Encoding Intensional Type Analysis
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
Stephanie Weirich
ECOOP
2001
Springer
13 years 12 months ago
Precise Constraint-Based Type Inference for Java
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...
Tiejun Wang, Scott F. Smith
ICFP
2004
ACM
14 years 7 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
TIC
1998
Springer
13 years 11 months ago
Polymorphic Equality - No Tags Required
Polymorphic equality is a controversial language construct. While being convenient for the programmer, it has been argued that polymorphic equality (1) invites to violation of soft...
Martin Elsman