• DOI:10.1051/ITA:1999130
Corpus ID: 13042720

Call-by-value Solvability

@article{Paolini1999CallbyvalueS,
  title={Call-by-value Solvability},
  author={Luca Paolini and S. Rocca},
  journal={RAIRO Theor. Informatics Appl.},
  year={1999},
  volume={33},
  pages={507-534}
}

• Luca Paolini, S. Rocca
• Published 1999
• Computer Science, Mathematics
• RAIRO Theor. Informatics Appl.

The notion of solvability in the call-by-value λ -calculus is defined and completely characterized, both from an operational and a logical point of view. The operational characterization is given through a reduction machine, performing the classical β -reduction, according to an innermost strategy. In fact, it turns out that the call-by-value reduction rule is too weak for capturing the solvability property of terms. The logical characterization is given through an intersection type assignment… Expand

View via Publisher

di.unito.it

Save to Library

Create Alert

Cite

Launch Research Feed