8 citations · 11 across the 3 of their papers we have counts for
8 papers
Strategies for Asymptotic Normalization
Claudia Faggian, Giulio Guerrieri
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of s…
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version)
Claudia Faggian, Giulio Guerrieri
In each variant of the lambda-calculus, factorization and normalization are two key-properties that show how results are computed. Instead of proving factorization/normalization fo…
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…
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…
Factorization and Normalization, Essentially
Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri
Lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as…
Lambda Calculus and Probabilistic Computation
Claudia Faggian, Simona Ronchi della Rocca
We introduce two extensions of the -calculus with a probabilistic choice operator, and , modeling respectively call-by-value and call-by-name pr…