论文信息 - Experience with an applicative string processing language

Experience with an applicative string processing language

Experience using and implementing the language Poplar is described. The major conclusions are: Applicative programming can be made more natural through the use of built-in iterative operators and post-fix notation. Clever evaluation strategies, such as lazy evaluation, can make applicative programming more computationally efficient. Pattern matching can be performed in an applicative framework. Many problems remain.

[1] William H. Burge,et al. Recursive Programming Techniques , 1975 .

[2] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[3] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .

[4] Ralph E. Griswold,et al. The SNOBOL 4 programming language , 1968 .

[5] Aaron J. Goldberg,et al. Smalltalk-72 instruction manual , 1976 .

[6] P. J. Landin,et al. The next 700 programming languages , 1966, CACM.

[7] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, Commun. ACM.

[8] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.

[9] John W. Backus,et al. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[10] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[11] Peter Henderson,et al. A lazy evaluator , 1976, POPL.

[12] D. L. Parnas,et al. On the criteria to be used in decomposing systems into modules , 1972, Software Pioneers.

[13] John McCarthy,et al. Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[14] Robin Milner,et al. A Metalanguage for interactive proof in LCF , 1978, POPL.

[15] David Canfield Smith,et al. The LISP7O Pattern Matching System , 1973, IJCAI.