Via Emlyn O’Regan

Originally shared by amen zwa

Here is a small collection of classic writings on #functionalProgramming, which have been made available online. I hope today’s computer science students find these as illuminating as did those of yesterday.

• Recursive Functions of Symbolic Expressions

[McCarthy, 1960, https://goo.gl/y4xr4G]

• The Next 700 Programming Languages

[Landin, 1966, https://goo.gl/FLim9X]

• Categories for the Working Mathematician

[Mac Lane, 1971, https://goo.gl/kigKWo]

• cons Should Not Evaluate Its Arguments

[Friedman, 1976, https://goo.gl/Uojydf]

• Can Programming Be Liberated from the von Neumann Style?

[Backus, 1977, https://goo.gl/S6sYuB]

• Computational Lambda Calculus and Monads

[Moggi, 1989, https://goo.gl/A2W8Ja]

• Conception, Evolution, and Application

[Hudak, 1989, https://goo.gl/LpFRb1]

• Why Functional Programming Matters

[Hughes, 1989, https://goo.gl/SDBsHm]

• Church’s Thesis

[Turner, 2006, https://goo.gl/HzX8X3]