Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
Abstract. We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are ...
- In this paper we investigate mixture of experts problems in the context of Local-Global Neural Networks. This type of architecture was originaly conceived for functional approxim...
"Constructive Type theory has been a topic of research interest to computer
scientists, mathematicians, logicians and philosophers for a number of years.
For computer scient...
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...