Sciweavers

429 search results - page 48 / 86
» Polymorphic typed defunctionalization
Sort
View
SBIA
2010
Springer
13 years 8 months ago
High-Level Modeling of Component-Based CSPs
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
Raphaël Chenouard, Laurent Granvilliers, Rica...
ESOP
2009
Springer
14 years 4 months ago
An Interval-Based Inference of Variant Parametric Types
Abstract. Variant parametric types (VPT) represent the successful result of combining subtype polymorphism with parametric polymorphism to support a more flexible subtyping for Ja...
Florin Craciun, Wei-Ngan Chin, Guanhua He, Shengch...
ICFP
2004
ACM
14 years 9 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
ICFP
2006
ACM
14 years 9 months ago
Extensible programming with first-class cases
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
Matthias Blume, Umut A. Acar, Wonseok Chae
APLAS
2009
ACM
14 years 4 months ago
Witnessing Purity, Constancy and Mutability
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
Ben Lippmeier