Data di Pubblicazione:
2015
Abstract:
We study an extension of Plotkin's call-by-value lambda-calculus by means of two commutation rules (sigma-reductions). Recently, it has been proved that this extended calculus provides elegant characterizations of many semantic properties, as for example solvability. We prove a standardization theorem for this calculus by generalizing Takahashi's approach of parallel reductions. The standardization property allows us to prove that our calculus is conservative with respect to the Plotkin's one. In particular, we show that the notion of solvability for this calculus coincides with that for Plotkin's call-by-value lambda-calculus.
Tipologia CRIS:
04A-Conference paper in volume
Elenco autori:
Guerrieri, Giulio; Paolini, Luca; Ronchi Della Rocca, S.
Link alla scheda completa:
Link al Full Text:
Titolo del libro:
13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)
Pubblicato in: