Sciweavers

429 search results - page 70 / 86
» Parameter-free polymorphic types
Sort
View
CACM
2000
94views more  CACM 2000»
14 years 9 months ago
Abstract Class Hierarchies, Factories, and Stable Designs
Class Hierarchies, Factories, and Stable Designs M uch of the debate about the general aptness of class hierarchies is rooted in the different objectives taxonomists and implemente...
Friedrich Steimann
ECSA
2010
Springer
14 years 8 months ago
Industry taxonomy engineering: the case of the European software ecosystem
Presently, no methods exist that support the creation process of an industry taxonomy within a specific domain. Without such a method, taxonomies remain erroneous, making the deve...
Ivo Hunink, Rene van Erk, Slinger Jansen, Sjaak Br...
SBIA
2010
Springer
14 years 7 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...
POPL
2009
ACM
15 years 10 months ago
State-dependent representation independence
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
Amal Ahmed, Derek Dreyer, Andreas Rossberg
CADE
2001
Springer
15 years 9 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther