论文信息 - The lazy call-by-value Lamda-Calculus - 字舞流文

The lazy call-by-value Lamda-Calculus

Furio Honsell | Simona Ronchi Della Rocca | Lavinia Egidi | F. Honsell | S. D. Rocca | Lavinia Egidi

[1] Furio Honsell,et al. An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus , 1992, J. Comput. Syst. Sci..

[2] S. Abramsky. The lazy lambda calculus , 1990 .

[3] C.-H. Luke Ong. The Lazy Lambda Calculus : an investigation into the foundations of functional programming , 1988 .

[4] Ketan Mulmuley,et al. Fully Abstract Submodels of Typed Lambda Calculi , 1986, J. Comput. Syst. Sci..

[5] Mariangiola Dezani-Ciancaglini,et al. A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[6] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[7] Christopher P. Wadsworth,et al. The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..

[8] M. Hyland. A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus , 1976 .

[9] Gordon D. Plotkin,et al. Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..

[10] P. J. Landin. The Mechanical Evaluation of Expressions , 1964, Comput. J..