37 search results - page 3 / 8 » mst 2008 |
MST
2008
13 years 5 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
MST
2008
13 years 5 months ago
2008
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised throu...
MST
2008
13 years 5 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
MST
2008
13 years 5 months ago
2008
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
MST
2008
13 years 5 months ago
2008
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs...