Sciweavers

121 search results - page 8 / 25
» Parametric polymorphism for XML
Sort
View
DLS
2005
176views Languages» more  DLS 2005»
14 years 25 days ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers
TACS
1991
Springer
14 years 2 months ago
An Extension of System F with Subtyping
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
Luca Cardelli, Simone Martini, John C. Mitchell, A...
JOT
2010
76views more  JOT 2010»
13 years 9 months ago
A Program Transformation Technique to Support AOP within C++ Template
Aspect-oriented programming (AOP) provides assistance in modularizing concerns that crosscut the boundaries of system decomposition. Aspects have the potential to interact with ma...
Suman Roychoudhury, Jeff Gray, Jing Zhang, Purusho...
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 7 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
ICFP
2004
ACM
14 years 10 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