Characterizing polynomial and exponential complexity classes in elementary lambda-calculus

Autor: Baillot, Patrick, De Benedetti, Erika, Ronchi Della Rocca, Simona

Publikováno v: In Information and Computation August 2018 261 Part 1:55-77

Strong normalization from an unusual point of view

Autor: Paolini, Luca, Pimentel, Elaine, Ronchi Della Rocca, Simona

Publikováno v: In Theoretical Computer Science 29 April 2011 412(20):1903-1915

Call-By-Value, Again!

Autor: Kerinec, Axel, Manzonetto, Giulio, Ronchi Della Rocca, Simona

The quest for a fully abstract model of the call-by-value λ-calculus remains crucial in programming language theory, and constitutes an ongoing line of research. While a model enjoying this property has not been found yet, this interesting problem a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1aff061d22be2e77fa1a270e7b6f57f8

Solvability in a Probabilistic Setting (Invited Talk)

Autor: Ronchi Della Rocca, Simona, Dal Lago, Ugo, Faggian, Claudia

Publikováno v: International Conference on Formal Structures for Computation and Deduction, FSCD 2020
International Conference on Formal Structures for Computation and Deduction, FSCD 2020, Jun 2020, Paris, France. ⟨10.4230/LIPIcs.FSCD.2020.1⟩

International audience; The notion of solvability, crucial in the λ-calculus, is conservatively extended to a probabilistic setting, and a complete characterization of it is given. The employed technical tool is a type assignment system, based on no

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69becf48177ebb8972c383862a96b963
https://hal.archives-ouvertes.fr/hal-03044443

Towards an Intersection Typed System à la Church

Autor: Liquori, Luigi, Ronchi della Rocca, Simona

Publikováno v: In Electronic Notes in Theoretical Computer Science 19 July 2005 136:43-56