Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
In this paper we study the modelling of consensus reaching in a ‘soft’ environment, i.e. when the individual testimonies are expressed as fuzzy preference relations. Here cons...
Mario Fedrizzi, Michele Fedrizzi, Ricardo A. Marqu...
This paper studies the exponential stabilization problem for discrete-time switched linear systems based on a control-Lyapunov function approach. A number of versions of converse c...
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...