From Function Level Semantics to Program Transformation and Optimization

The software crisis results from our disorderly concepts of "program". These make programming an art, rather than an engineering discipline. Such a discipline would at least require that we have stocks of useful off-the-shelf programs and collections of standard theorems that can be applied repeatedly. We have neither.

[1]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[2]  Norman H. Cohen.  Characterization and elimination of redundancy in recursive programs , 1979, POPL '79.

[3]  D. A. Turner.  The semantic elegance of applicative languages , 1981, FPCA '81.

[4]  Harlan D. Mills,et al.  Trace: Tennessee Research and CreativeExchange , 2022 .

[5]  Richard S. Bird.  The promotion and accumulation strategies in transformational programming , 1984, TOPL.

[6]  John W. Backus,et al.  Function level programs as mathematical objects , 1981, FPCA '81.

[7]  Philip Wadler,et al.  Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time , 1984, LFP '84.

[8]  James J. Horning,et al.  FP with data abstraction and strong typing , 1981, FPCA '81.

[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 W. Backus,et al.  The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions , 1981, ICFPC.

[11]  Jean E. Sammet.  ACM president's letter: relation of ACM activities to finances , 1975, CACM.

[12]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[13]  Jonathan C. Shultis,et al.  Transformations of FP program schemes , 1981, FPCA '81.

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

[15]  Philip Wadler,et al.  Applicative style programming, program transformation, and list operators , 1981, FPCA '81.

[16]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[17]  John H. Williams,et al.  On the Development of the Algebra of Functional Programs , 1982, TOPL.

[18]  Joseph Y. Halpern,et al.  Denotational semantics and rewrite rules for FP , 1985, POPL.

[19]  R. J. M. Hughes,et al.  Super-combinators a new implementation method for applicative languages , 1982, LFP '82.

[20]  A. C. Norman,et al.  Some practical methods for rapid combinator reduction , 1984, LFP '84.

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