Vendredi 27 Février
Heure: 
11:00  12:30 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
Linear numeral systems 
Description: 
Ian Mackie We take a fresh look at an old problem of representing natural numbers in the lambdacalculus. Our interest is in finding representations where we can compute efficiently (and where possible, in constant time) the following functions: successor, predecessor, addition, subtraction and test for zero. Surprisingly, we find a solution in the linear lambdacalculus, where copying and erasing are not permitted. 

