Résumé : In our overview talk, we present a quantitative analysis of lambda calculus and combinatory logic under various combinator bases, focusing on the asymptotic properties of both computational models, such as normalisation or typeability. We discuss utilised analytic methods, their limitations and current challenges. Finally, we discuss effective random sampling techniques, in particular Boltzmann models, and their application in automated software verification tools.
[arXiv]
Dernière modification : Monday 27 May 2024 | Contact pour cette page : Cyril.Banderier at lipn.univ-paris13.fr |