| Abstract |
| This paper is about a categorical approach for modeling the pure (i.e., without constants) call-by-value lambda-calculus, defined by Plotkin as a restriction of the call-by-name lambda-calculus. In particular, the properties a category CC must enjoy to describe a model of call-by-value lambda-calculus are given. The category CC is general enough to catch models in Scott Domains and Coherence Spaces. |
@article{Pravato+Ronchi+Roversi:1999-MSCS,
number = 5,
volume = 9,
author = {Pravato, Alberto and Ronchi Della Rocca, Simona and Roversi, Luca},
url = {http://www.di.unito.it/~rover/RESEARCH/PUBLICATIONS/1999-MSCS/PravatoRonchiRoversi1999MSCS.ps.gz},
title = {The call by value $\lambda$-calculus: a semantic investigation},
abstract = {This paper is about a categorical approach for modeling the pure
(i.e., without constants) call-by-value lambda-calculus, defined
by Plotkin as a restriction of the call-by-name lambda-calculus.
In particular, the properties a category CC must enjoy to describe
a model of call-by-value lambda-calculus are given. The category
CC is general enough to catch models in Scott Domains and
Coherence Spaces.},
year = {1999},
pages = {617 - 650},
journal = {Mathematical Structures in Computer Science},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)
