Call-by-value solvability

Luca Paolini; Simona Ronchi Della Rocca

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1999)

  • Volume: 33, Issue: 6, page 507-534
  • ISSN: 0988-3754

How to cite

top

Paolini, Luca, and Ronchi Della Rocca, Simona. "Call-by-value solvability." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 33.6 (1999): 507-534. <http://eudml.org/doc/92618>.

@article{Paolini1999,
author = {Paolini, Luca, Ronchi Della Rocca, Simona},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {solvability; -calculus},
language = {eng},
number = {6},
pages = {507-534},
publisher = {EDP-Sciences},
title = {Call-by-value solvability},
url = {http://eudml.org/doc/92618},
volume = {33},
year = {1999},
}

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
PB - EDP-Sciences
VL - 33
IS - 6
SP - 507
EP - 534
LA - eng
KW - solvability; -calculus
UR - http://eudml.org/doc/92618
ER -

References

top
  1. [1] S. Abramsky and C. H. L. Ong, Pull Abstraction in the Lazy Lambda Calculus. Information and Computation 105 (1993) 159-267. Zbl0779.03003MR1226344
  2. [2] H. Barendregt, The Lambda Calculus: Its syntax and semantics. North Holland (1984). Zbl0551.03007MR774952
  3. [3] H. Barendregt, M. Coppo and M. Dezani-Ciancaglini, A filter Lambda Model and the completeness of type assignment. J. Symbolic Logic 48 (1983) 85-116. Zbl0545.03004MR727784
  4. [4] L. Egidi, F. Honsell and S. Ronchi Della Rocca, Operational, denotational and logicals descriptions: A case study. Fund. Inform. (1992) 149-169. Zbl0762.68042MR1174365
  5. [5] J. R. Hindley and J. P. Seldin, Introduction to Combinates and λ-Calculus. Cambridge University Press (1986). Zbl0614.03014MR879272
  6. [6] F. Honsell and S. Ronchi Della Rocca, An Approximation Theorem for topological lambda models and the topological incompleteness of Lambda Calculus. J. Comput. Systems Sci. 45 (1992) 49-75. Zbl0763.03012MR1170917
  7. [7] M. Hyland, A syntactic characterization of the equality in some Models for the Lambda Calculus. J. London Math. Soc. (1976) 361-370. Zbl0329.02010MR396232
  8. [8] P. J. Landin, The mechanical evaluation of expressions. Comput. J. (1964). Zbl0122.36106
  9. [9] R. Milner, M. Tofte and R. Harfen, The definition of standard ML, M. I. T. (1990). 
  10. [10] L. Paolini, La chiamata per valore e la valutazione pigra nel lambda calcolo. Tesi di Laurea, Universitá di Torino, Dip. Informatica (1997). 
  11. [11] G. Plotkin, Call by value, call by name and the λ-calculus. Theore. Comput. Sci. (1975) 125-159. Zbl0325.68006MR429501
  12. [12] S. Ronchi Della Rocca, Basic λ-calculus. Notes for the Summer School Proof and Types, Chambery (1993). 
  13. [13] G. L. Steele and G. J. Sussman, The revised report on Scheme, AI Memo 452, M.I.T. (1978). 
  14. [14] S. Thompson, HASKELL: The craft of functional programming. Addison-Wesley (1996). 
  15. [15] C. P. Wadsworth, The relation between computational and denotational properties for Scott D∞-models of the lambda calculus. SIAM J. Comput. 5 (1976) 488-522. Zbl0346.02013MR505308

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.