Sciweavers

5090 search results - page 455 / 1018
» Constructing Strategies for Programming
Sort
View
ICFP
2006
ACM
16 years 6 months ago
Boxy types: inference for higher-rank types and impredicativity
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annot...
Dimitrios Vytiniotis, Stephanie Weirich, Simon L. ...
ICFP
2005
ACM
16 years 6 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen
PEPM
2009
ACM
16 years 3 months ago
Designing aspects for side-effect localization
Computation performed in many typical aspects involve side effects. In a purely functional setting, adding such aspects using techniques such as monadification will generally lea...
Kung Chen, Jia-Yin Lin, Shu-Chun Weng, Siau-Cheng ...
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
16 years 1 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
SAC
2010
ACM
16 years 1 months ago
Variable ranges in linear constraints
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
Salvatore Ruggieri, Fred Mesnard