811 search results - page 7 / 163 » Refactoring Using Type Constraints |
ECOOP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...
SAS
1994
Springer
14 years 19 days ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
DAGSTUHL
2007
13 years 10 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
ERLANG
2008
ACM
13 years 10 months ago
2008
ACM
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...