Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Association between classes is a central construct in OO modeling. However, precise semantics of associations has not been defined, and only the most basic types are implemented i...
Mathematics is forcing towards a consistent framework of theory development. Computer Science is an engineering discipline and sometimes suffers from ad-hoc definitions. Transac...
This paper reports on results concerning the combination of non-standard semantics via interpreters. We define what a semantics combination means and identify under which condition...