Récursion terminale / tail recursion (pour éviter les débordements de pile / stock overflow). Du sucre syntaxique pour la correspondance de motifs (match with, gardes de motifs, regroupement de motifs, alias). Quelques explications sur la persistance et le ramassage automatique des miettes (garbage collecting).
Pierre Boudes
-
Semaine 4 – récursion terminale (tail recursion), persistance, plus de syntaxe
(Programmation fonctionnelle...)18 février 2014, parphoto en cc-by par Jan Ramroth
... | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 | 76 | 77 | 78 | 79 | 80 | 81 | 82 | 83 | 84 | 85 | 86 | 87 |...
Welcome on my professional home page. My name is Pierre Boudes. Holding a phD in maths since 2002, I am maître de conférences in computer science at Paris 13 university, since september 2005.
More precisely, I am :
– Researcher in proof theory and theory of programming at the computer science lab of Paris nord university (Laboratoire d’informatique de Paris nord, LIPN), UMR CNRS 7030.
– Teacher (and sometimes a kind of administrative) at the institut Galilée.
I usually reply within one day to (well-formed) emails addressed to boudes@univ-paris13.fr. You can also contact me by other means. I have reduced my presence on the Fediverse to two Mastodon accounts:
– professional
– personal.