This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Multi-agent systems are an attractive approach to modeling systems of interacting entities, but in some cases mathematical models of these systems can offer complementary benefits...
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...
Formal theories of multi-agent systems require a rich ontology for modelling the dynamics of social behaviour. In this paper a formal analysis of the social behaviour of individua...