Experience with an applicative string processing language

  • Authors:
  • James H. Morris;Eric Schmidt;Philip Wadler

  • Affiliations:
  • Xerox, Palo Alto Research Center;University of California, Berkeley;Carnegie-Mellon University

  • Venue:
  • POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
  • Year:
  • 1980

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.