@article{ITA_1999__33_6_507_0, author = {Paolini, Luca and Ronchi Della Rocca, Simona}, title = {Call-by-value solvability}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {507--534}, publisher = {EDP-Sciences}, volume = {33}, number = {6}, year = {1999}, mrnumber = {1747514}, zbl = {0958.68061}, language = {en}, url = {http://www.numdam.org/item/ITA_1999__33_6_507_0/} }
TY - JOUR AU - Paolini, Luca AU - Ronchi Della Rocca, Simona TI - Call-by-value solvability JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1999 SP - 507 EP - 534 VL - 33 IS - 6 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1999__33_6_507_0/ LA - en ID - ITA_1999__33_6_507_0 ER -
%0 Journal Article %A Paolini, Luca %A Ronchi Della Rocca, Simona %T Call-by-value solvability %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1999 %P 507-534 %V 33 %N 6 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1999__33_6_507_0/ %G en %F ITA_1999__33_6_507_0
Paolini, Luca; Ronchi Della Rocca, Simona. Call-by-value solvability. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 6, pp. 507-534. http://www.numdam.org/item/ITA_1999__33_6_507_0/
[1] Pull Abstraction in the Lazy Lambda Calculus. Information and Computation 105 (1993) 159-267. | MR | Zbl
and ,[2] The Lambda Calculus: Its syntax and semantics. North Holland (1984). | MR | Zbl
,[3] A filter Lambda Model and the completeness of type assignment. J. Symbolic Logic 48 (1983) 85-116. | MR | Zbl
, and ,[4] Operational, denotational and logicals descriptions: A case study. Fund. Inform. (1992) 149-169. | MR | Zbl
, and ,[5] Introduction to Combinates and λ-Calculus. Cambridge University Press (1986). | MR | Zbl
and ,[6] An Approximation Theorem for topological lambda models and the topological incompleteness of Lambda Calculus. J. Comput. Systems Sci. 45 (1992) 49-75. | MR | Zbl
and ,[7] A syntactic characterization of the equality in some Models for the Lambda Calculus. J. London Math. Soc. (1976) 361-370. | MR | Zbl
,[8] The mechanical evaluation of expressions. Comput. J. (1964). | Zbl
,[9] The definition of standard ML, M. I. T. (1990).
, and ,[10] La chiamata per valore e la valutazione pigra nel lambda calcolo. Tesi di Laurea, Universitá di Torino, Dip. Informatica (1997).
,[11] Call by value, call by name and the λ-calculus. Theore. Comput. Sci. (1975) 125-159. | MR | Zbl
,[12] Basic λ-calculus. Notes for the Summer School Proof and Types, Chambery (1993).
,[13] The revised report on Scheme, AI Memo 452, M.I.T. (1978).
and ,[14] HASKELL: The craft of functional programming. Addison-Wesley (1996).
,[15] The relation between computational and denotational properties for Scott D∞-models of the lambda calculus. SIAM J. Comput. 5 (1976) 488-522. | MR | Zbl
,