The "simplest functional programming language" is neither simple nor functional

  • Authors:
  • Elfriede Fehr

  • Affiliations:
  • Lehrstuhl für Informatik II, RWTH-Aachen, D-5100 Aachen, West-Germany

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

This note is a discussion on David Spector's paper: "The Simplest Functional Programming Language" (SIGPLAN NOTICES18.1 (1983)). It is shown that neither syntax nor semantics of the referred language $ is simpler than that of the pure λ-calculus, and furthermore, this language does not meet the requirement of substitutivity of equivalence, which is essential for functional languages.