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

@article{Guerrieri2017StandardizationAC,
  title={Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus},
  author={Giulio Guerrieri and Luca Paolini and S. D. Rocca},
  journal={Log. Methods Comput. Sci.},
  year={2017},
  volume={13}
}
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 this extended calculus is a conservative refinement of Plotkin's one. In particular, the notions of solvability and potential valuability for this calculus coincide with those for Plotkin's call-by… Expand
The Call-By-Value Lambda-Calculus with Generalized Applications
Revisiting Call-by-value Bohm trees in light of their Taylor expansion
New Semantical Insights Into Call-by-Value λ-Calculus
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
Types of Fireballs (Extended Version)
Call-By-Value, Again!
Factorization and Normalization, Essentially
Types of Fireballs
...
1
2
...

References

SHOWING 1-10 OF 52 REFERENCES
Standardization of a Call-By-Value Lambda-Calculus
Head reduction and normalization in a call-by-value lambda-calculus
Call-by-Value Solvability, Revisited
A Semantical and Operational Account of Call-by-Value Solvability
Call-by-Value lambda-calculus and LJQ
Call-by-Value Separability and Computability
Proof nets and the call-by-value λ-calculus
Open Call-by-Value
...
1
2
3
4
5
...