Abstract
The aim of this paper is to study the notion of separability in the call-by-value setting.
Separability is the key notion used in the Böhm Theorem, proving that syntactically different βη-normal forms are separable in the classical λ-calculus endowed with β-reduction, i.e. in the call-by-name setting.
In the case of call-by-value λ-calculus endowed with β v-reduction and η v-reduction (see Plotkin [7]), it turns out that two syntactically different βη v-normal forms are separable too, while the notion of β v-normal form and βη v-normal form is semantically meaningful.
An explicit representation of Kleene’s recursive functions is presented. The separability result guarantees that the representation makes sense in every consistent theory of call-by-value, i.e. theories in which not all terms are equals.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Barendregt, The Lambda Calculus: its syntax and semantics, North Holland, 1984.
C. Böhm, Alcune proprietà delle forme βν-normali λK-calcolo, Pubblicazioni dell’ istituto per le applicazioni del calcolo, n.696, 1968.
M. Hyland, A syntactic characterization of the equality in some models of the Lambda calculus, Journal of London Mathematical Society, 1976, pp. 361–370.
P. J. Landin, The mechanical evaluation of expressions, Computer Journal, 1964.
L. Paolini, S. Ronchi della Rocca, Call-by-value solvability, Theoretical Informatics and Applications, n.33, 1999, pp. 507–534.
L. Paolini, La chiamata per valore e la valutazione pigra nel lambda calcolo, Tesi di Laurea, Università degli Studi di Torino, Dip. Informatica, 1998.
G. Plotkin, Call-by-Value, Call-by-Name and the λ-calculus, Theoretical Computer Science, 1975, pp. 125–159.
S. Ronchi Della Rocca, Notes for the Summer School “Proof and Types”, EDP Sciences, 1993.
C. P. Wadsworth, The relation between computational and denotational properties for Scott D∞-models of the lambda-calculus, SIAM Journal of computing, vol.5, 1976, pp. 488–522.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paolini, L. (2001). Call-by-Value Separability and Computability. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-45446-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42672-1
Online ISBN: 978-3-540-45446-5
eBook Packages: Springer Book Archive