Abstract Constructing correspondencesbetween points characterizing one shape with those characterizing another is crucial to understanding what the two shapes have in common. These...
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
Functional requirements contain, and systems exhibit, the behavior summarized below.Despite the advances in software engineering since 1968, how to go from a set of functional req...
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
Ulrik Pagh Schultz, Julia L. Lawall, Charles Conse...