IFIP
2000
Springer
13 years 11 months ago
2000
Springer
IFIP
2000
Springer
13 years 11 months ago
2000
Springer
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
Achieving good performance in bytecoded language interpreters is di cult without sacri cing both simplicity and portability. This is due to the complexity of dynamic translation (...
IFIP
1998
Springer
13 years 11 months ago
1998
Springer
ICFP
2000
ACM
13 years 11 months ago
2000
ACM
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
ICFP
2000
ACM
13 years 11 months ago
2000
ACM
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relatio...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...