LIPIcs - Leibniz International Proceedings in Informatics. 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)
Doi
Abstract
We study an extension of Plotkin\u27s 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\u27s approach of parallel reductions. The standardization property allows us to prove that our calculus is conservative with respect to the Plotkin\u27s one. In particular, we show that the notion of solvability for this calculus coincides with that for Plotkin\u27s call-by-value lambda-calculus
