Call-by-Value Combinatory Logic and the Lambda-Value Calculus
暂无分享,去创建一个
[1] M. Schönfinkel. Über die Bausteine der mathematischen Logik , 1924 .
[2] Haskell B. Curry. Grundlagen der kombinatorischen Logik , 1930 .
[3] A. Church. The calculi of lambda-conversion , 1941 .
[4] Haskell B. Curry,et al. Combinatory Logic, Volume I , 1959 .
[5] Otto C. Juelich,et al. On the recursive programming techniques , 1964, CACM.
[6] Nicolas D. Goodman. A simplification of combinatory Logic , 1972, J. Symb. Log..
[7] Gordon D. Plotkin,et al. Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..
[8] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..
[9] R. J. M. Hughes,et al. Super-combinators a new implementation method for applicative languages , 1982, LFP '82.
[10] Albert R. Meyer,et al. What is a Model of the Lambda Calculus? , 1982, Inf. Control..
[11] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[12] Paul Hudak,et al. Serial Combinators: "Optimal" Grains of Parallelism , 1985, FPCA.
[13] R. Smullyan. To mock a mockingbird and other logic puzzles : including an amazing adventure in combinatory logic , 1985 .
[14] Richard Kennaway,et al. Director strings as combinators , 1988, TOPL.