On the efficiency of categorical combinators as a rewriting system
暂无分享,去创建一个
[1] Pierre-Louis Curien,et al. The Categorical Abstract Machine , 1987, Sci. Comput. Program..
[2] J. Roger Hindley,et al. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .
[3] D. A. Turner,et al. Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.
[4] Rafael Dueire Lins. On the efficiency of categorical combinators in applicative languages , 1986 .
[5] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[6] Rafael Dueire Lins. A New Formula for the Execution of Categorial Combinators , 1986, CADE.
[7] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..