Sciweavers

17 search results - page 3 / 4
» Polymorphic typed defunctionalization and concretization
Sort
View
SAC
2008
ACM
13 years 4 months ago
Runtime concepts for the C++ standard template library
A key benefit of generic programming is its support for producing modules with clean separation. In particular, generic algorithms are written to work with a wide variety of unmod...
Peter Pirkelbauer, Sean Parent, Mat Marcus, Bjarne...
JFP
2007
136views more  JFP 2007»
13 years 5 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
SBIA
2010
Springer
13 years 3 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...
APLAS
2008
ACM
13 years 7 months ago
Exception Handlers as Extensible Cases
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
Matthias Blume, Umut A. Acar, Wonseok Chae
ICSM
2009
IEEE
13 years 12 months ago
Augmenting static source views in IDEs with dynamic metrics
Mainstream IDEs such as Eclipse support developers in managing software projects mainly by offering static views of the source code. Such a static perspective neglects any informa...
David Röthlisberger, Marcel Harry, Alex Villa...