Formal Methods in Computing(Most of the papers antecedent to 1995are not included in the list) FRAMES  NO FRAME

 paolini99tia (Article) Author(s) Luca Paolini and Simona Ronchi Della Rocca Title « Call-by-value Solvability » Journal Theoretical Informatics and Applications Volume 33 Number 6 Page(s) 507-534 Year 1999 ISSN number 0988-3754 URL http://www.di.unito.it/~ronchi/papers/solv.ps Note RAIRO Series, EDP-Sciences, France

 Annotation

RAIRO Series, EDP-Sciences

 Abstract The notion of solvability in the call-by-value $\lambda$-calculus is defined and completely characterized, from both an operational and a logical point of view. The operational characterization is given through a reduction machine performing the classical $\beta$-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 system, assigning types of a given shape to all and only the call-by-value solvable terms.

 BibTeX code

@article{paolini99tia,
number = {6},
volume = {33},
month = nov,
issn = {0988-3754},
author = {Paolini, Luca and Ronchi Della Rocca, Simona},
note = {RAIRO Series, EDP-Sciences, France},
url = {http://www.di.unito.it/~ronchi/papers/solv.ps},
abstract = {The notion of solvability in the call-by-value $\lambda$-calculus
is defined and completely characterized, from both an operational
and a logical point of view. The operational characterization is
given through a reduction machine performing the classical
$\beta$-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
system, assigning types of a given shape to all and only the
call-by-value solvable terms.},
tag = {Theoretical Informatics and Applications, RAIRO Series, EDP-Sciences},
localfile = {http://www.di.unito.it/~paolini/papers/cbv_solvability.pdf},
title = {Call-by-value Solvability},
annote = {RAIRO Series, EDP-Sciences},
journal = {Theoretical Informatics and Applications},
pages = {507-534},
year = {1999},
}

 Formal Methods in Computing(Most of the papers antecedent to 1995are not included in the list) FRAMES  NO FRAME

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)