153 search results - page 11 / 31 » entcs 2002 |
120
click to vote
ENTCS
2002
15 years 4 days ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
91
Voted
ENTCS
2002
15 years 4 days ago
2002
In this paper we present how refactoring of object-oriented programs can be accomplished by using refinement. Our approach is based on algebraic laws of an object-oriented languag...
ENTCS
2002
15 years 4 days ago
2002
If S = 0 is a system of n equations and unknowns over C and S() = 0 to what extent can we compute with the point ? In particular, can we decide whether or not a polynomial express...
93
Voted
ENTCS
2002
15 years 4 days ago
2002
An approach to software composition from heterogeneous components is presented. The focus is on heterogeneity of interaction styles. The interface of a component is described in an...
ENTCS
2002
15 years 4 days ago
2002
We show that the basic feasible functions of Cook and Urquhart's BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type i...