Sciweavers

5465 search results - page 6 / 1093
» Assigning Types to Processes
Sort
View
HOA
1993
15 years 1 months ago
Strong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
Steffen van Bakel, Maribel Fernández
PLDI
2003
ACM
15 years 2 months ago
Taming the IXP network processor
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...
Lal George, Matthias Blume
COR
2011
14 years 4 months ago
Size-reduction heuristics for the unrelated parallel machines scheduling problem
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job di...
Luis Fanjul-Peyro, Rubén Ruiz
ENTCS
2002
66views more  ENTCS 2002»
14 years 9 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
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 ...
Steffen van Bakel
PROCOMET
1998
14 years 11 months ago
Types for trees
We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating -terms (B
Franco Barbanera, Mariangiola Dezani-Ciancaglini, ...