2026-07-22T19:10:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5165 2024-03-06T10:36:11Z ddc:004 open_access

Standardization of a Call-By-Value Lambda-Calculus Guerrieri, Giulio Paolini, Luca Ronchi Della Rocca, Simona standardization,sequentialization,lambda-calculus,sigma-reduction,par- allel reduction call-by-value head reduction internal reduction solvability 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Giulio Guerrieri and Luca Paolini and Simona Ronchi Della Rocca 2015 Is Part Of LIPIcs, Volume 38, 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TLCA.2015.211 urn:nbn:de:0030-drops-51655 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TLCA.2015.211 eng https://creativecommons.org/licenses/by/3.0/legalcode