Sciweavers

267 search results - page 24 / 54
» Formal Parametric Polymorphism
Sort
View
ICFP
2007
ACM
16 years 1 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop
125
Voted
ICFP
2006
ACM
16 years 1 months ago
An object-oriented approach to datatype-generic programming
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...
Adriaan Moors, Frank Piessens, Wouter Joosen
104
Voted
EDOC
2003
IEEE
15 years 7 months ago
MQL: a Powerful Extension to OCL for MOF Queries
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
David Hearnden, Kerry Raymond, Jim Steel
106
Voted
ICFP
2000
ACM
15 years 6 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
102
Voted
CASES
2006
ACM
15 years 7 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner