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 ...
This paper proposes a code granulation space which can be applied to program construction and processing. Each granule in the space is defined as an improvement to the seed progra...
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
Knowledge representation languages that combine rules with object-oriented features akin to frame systems have recently attracted a lot of research interest, and F-logic is widely ...
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...