Completeness of type assignment systems with intersection, union, and type quantifiers

By Yokouchi H.  

Theoretical Computer Science, Vol. 272, Iss. 1, 2002-02 ,pp. : 341-398

Elsevier

Access to resources Recommend Favorite

Intersection type assignment systems with higher-order algebraic rewriting

By Barbanera F.   Fernandez M.  

Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. : 173-207

Elsevier

Access to resources Recommend Favorite

Completeness of intersection and union type assignment systems for call-by-value -models

By Ishihara  

Theoretical Computer Science, Vol. 272, Iss. 1, 2002-02 ,pp. : 197-221

Elsevier

Access to resources Recommend Favorite

Task assignment algorithms for two-type heterogeneous multiprocessors

By Raravi Gurulingesh   Andersson Björn   Nélis Vincent   Bletsas Konstantinos  

Real-Time Systems, Vol. 50, Iss. 1, 2014-01 ,pp. : 87-141

Springer Publishing Company

Access to resources Recommend Favorite

Assignment and sequencing models for thescheduling of process systems

By M. Pinto J.   E. Grossmann I.  

Annals of Operations Research, Vol. 81, Iss. 1, 1998-01 ,pp. : 433-466

Springer Publishing Company

Access to resources Recommend Favorite