Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus

We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant characterizations of many semantic properties. We prove that...

Popoln opis

Bibliografske podrobnosti

Principais autores:	Giulio Guerrieri, Luca Paolini, Simona Ronchi Della Rocca
Format:	Artigo
Jezik:	Inglês
Izdano:	Logical Methods in Computer Science e.V. 2017-12-01
Serija:	Logical Methods in Computer Science
Teme:	computer science - logic in computer science 03b40, 68n18 f.3.2 d.3.1 f.4.1
Online dostop:	https://lmcs.episciences.org/4162/pdf
Oznake:	Označite Brez oznak, prvi označite!