Most aspect-oriented languages provide only a fixed, built-in set of pointcut designators whose denotation is only described informally. As a consequence, these languages do not p...
This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic pro...
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
This paper describes the use of WatIF, a simple compiler intermediate form based on the -calculus, for writing compiler front-ends for a wide range of programming languages. Somew...
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...