Pierre Valarcher (Université Paris Est Créteil), From intentional behavior to algorithmic completeness.
Schedule
- Jan. 30, 2012, 14:30 - 15:00
Abstract
I propose to present problems of the algorithmic expressiveness of some programming
languages (imperative and functional) that compute extensionally the same
set of functions.
I propose to present problems of the algorithmic expressiveness of some programming languages (imperative and functional) that compute extensionally the same set of functions.