8 citations · 20 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LO2020
Intersection Types and (Positive) Almost-Sure Termination
Ugo Dal Lago, Claudia Faggian, Simona Ronchi Della Rocca
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice…
cs.LO2020
Factorize Factorization
Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization the…