Capturing Strong Reduction in Director String Calculus
暂无分享,去创建一个
[1] John Lamping. An algorithm for optimal lambda calculus reduction , 1989, POPL '90.
[2] György E. Révész. Axioms for the Theory of Lambda-Conversion , 1985, SIAM J. Comput..
[3] John Field,et al. On laziness and optimality in lambda interpreters: tools for specification and analysis , 1989, POPL '90.
[4] Rasmus Lerdorf,et al. Introduction to combinatory logic , 1972 .
[5] Paul Hudak,et al. Graphinators and the duality of SIMD and MIMD , 1988, LFP '88.
[6] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..
[7] Richard Kennaway,et al. Director strings as combinators , 1988, TOPL.
[8] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[9] Simon L. Peyton Jones,et al. The Implementation of Functional Programming Languages , 1987 .
[10] Paul Hudak,et al. A combinator-based compiler for a functional language , 1984, POPL '84.
[11] John Staples,et al. Optimal Evaluations of Graph-Like Expressions , 1980, Theor. Comput. Sci..
[12] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .