Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-28T22:39:51.235Z Has data issue: false hasContentIssue false
  • English
  • Français

The call-by-value λ-calculus: a semantic investigation

Published online by Cambridge University Press:  01 October 1999

ALBERTO PRAVATO ,
SIMONA RONCHI della ROCCA  and
LUCA ROVERSI
ALBERTO PRAVATO
Affiliation:
Università degli studi di Torino, Dipartimento di Informatica, C.so Svizzera 185 10149 TORINO. E-mail: [email protected], [email protected]
SIMONA RONCHI della ROCCA
Affiliation:
Università degli studi di Torino, Dipartimento di Informatica, C.so Svizzera 185 10149 TORINO. E-mail: [email protected], [email protected]
LUCA ROVERSI
Affiliation:
Institut de Matématiques de Luminy, UPR 9016 – 163 Av. de Luminy – Case 907 13288 MARSEILLE Cedex 9. E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper is about a categorical approach for modelling the pure (i.e., without constants) call-by-value λ-calculus, defined by Plotkin as a restriction of the call-by-name λ-calculus. In particular, we give the properties that a category Cbv must enjoy to describe a model of call-by-value λ-calculus. The category Cbv is general enough to catch models in Scott Domains and Coherence Spaces.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 9 , Issue 5 , October 1999 , pp. 617 - 650
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This work was supported by TMR-Marie Curie Grant, contract n. ERBFMBICT9601411