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

Authors:
Alberto Pravato;Simona Ronchi Della Rocca;Luca Roversi
Affiliations:
Università degli studi di Torino, Dipartimento di Informatica, C.so Svizzera 185 10149 TORINO. E-mail: pravato@di.unito.it, ronchi@di.unito.it;Università degli studi di Torino, Dipartimento di Informatica, C.so Svizzera 185 10149 TORINO. E-mail: pravato@di.unito.it, ronchi@di.unito.it;Institut de Matématiques de Luminy, UPR 9016 – 163 Av. de Luminy – Case 907 13288 MARSEILLE Cedex 9. E-mail: rover@iml.univ-mrs.fr
Venue:
Mathematical Structures in Computer Science
Year:
1999

Citing 10
Cited 3

Linear logic

Theoretical Computer Science
Notions of computation and monads

Information and Computation
Categories, types, and structures: an introduction to category theory for the working computer scientist

Categories, types, and structures: an introduction to category theory for the working computer scientist
The geometry of optimal lambda reduction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operational, denotational and logical descriptions: a case study

Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Some Results on the Full Abstraction Problem for Restricted Lambda Calculi

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Categorical semantics of the call-by-value lambda-calculus

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Some philosophical issues concerning theories of combinators

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Linear Logic, Monads and the Lambda Calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Filter Models and Easy Terms

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Parametric parameter passing λ-calculus

Information and Computation
Calculi, types and applications

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.