FOSSACS
2001
Springer
14 years 12 days ago
2001
Springer
FOSSACS
2001
Springer
14 years 12 days ago
2001
Springer
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
FOSSACS
2001
Springer
14 years 12 days ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
FOSSACS
2001
Springer
14 years 12 days ago
2001
Springer
FOSSACS
2001
Springer
14 years 12 days ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
FOSSACS
2001
Springer
14 years 12 days ago
2001
Springer
The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting...
FOSSACS
2001
Springer
14 years 12 days ago
2001
Springer
FASE
2001
Springer
14 years 12 days ago
2001
Springer
FASE
2001
Springer
14 years 12 days ago
2001
Springer
FASE
2001
Springer
14 years 12 days ago
2001
Springer
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...