eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2015-06-15
211
225
10.4230/LIPIcs.TLCA.2015.211
article
Standardization of a Call-By-Value Lambda-Calculus
Guerrieri, Giulio
Paolini, Luca
Ronchi Della Rocca, Simona
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.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol038-tlca2015/LIPIcs.TLCA.2015.211/LIPIcs.TLCA.2015.211.pdf
standardization,sequentialization,lambda-calculus,sigma-reduction,par- allel reduction
call-by-value
head reduction
internal reduction
solvability