Ronchi Della Rocca S. Paolini L.
Lazy
logical semantics
Electronic Notes in Theoretical Computer Science, 104:235-251,
2004
The lazy evaluation of the lambda-calculus, both in
call-by-name and in call-by-value setting, is studied.
Starting from a logical descriptions of two topological
models of such calculi, a pre-order relation on terms,
stratified by types, is defined, which grasps exactly
the two operational semantics we want to model. Such a
relation can be used for building two fully abstract
models.
[ bib |
.pdf ]
Back
This file has been generated by
bibtex2html 1.43