ICALP
1997
Springer
13 years 12 months ago
1997
Springer
We propose a general approach for defining behavioural preorders over process terms as the maximal pre–congruences induced by basic observables. We will consider three of these...
ICALP
1997
Springer
13 years 12 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
ICALP
1997
Springer
13 years 12 months ago
1997
Springer
ECOOPW
1997
Springer
13 years 12 months ago
1997
Springer
This report investigates the relationships between design patterns and programming languages. A comparison is carried out between the usual track of programming languages developme...
ECOOP
1997
Springer
13 years 12 months ago
1997
Springer
We propose a new model for exible composition of objects et of features. Features are similar to (abstract) subclasses, but only provide the core functionality of a (sub)class. Ove...
ECOOP
1997
Springer
13 years 12 months ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
ECOOP
1997
Springer
13 years 12 months ago
1997
Springer
We present the design and rationale of a new statically-typed object-oriented language, LOOM. LOOM retains most of the features of the earlier language PolyTOIL. However the subtyp...
CTCS
1997
Springer
13 years 12 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
CTCS
1997
Springer
13 years 12 months ago
1997
Springer
POPL
1997
ACM
13 years 12 months ago
1997
ACM
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...