Recursion Equations as a Programming Language

详细信息    查看全文

• 关键词：Lazy evaluation ; List comprehensions ; “List of successes” Kent recursive calculator
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9600
• 期：1
• 页码：459-478
• 全文大小：514 KB
• 参考文献：Ackermann, W.B., Dennis, J.B.: VAL - preliminary reference manual. MIT Laboratory for Computer Science, June 1979
  Arvind, Gostelow, K.P., Plouffe, W.: An asynchronous programming language and computing machine. University of California at Irvine, December 1978
  Backus, J.: Can Programming be liberated from the Von Neumann style: a functional style and its algebra of programs. CACM 21(8), 613–641 (1978)MathSciNet CrossRef MATH
  Clarke, J.W., Gladstone, P.J.S., Maclean, C.D., Norman, A.C.: SKIM - S, K, I reduction machine. In: Proceedings LISP Conference, Stanford (1980)
  Darlington, J., Henderson, P., Turner, D.A. (eds.): Functional Programming and Its Applications. Cambridge University Press, Cambridge (1982)MATH
  Dennis, J.B.: The varieties of data flow computers. MIT Computation Structures Group, Memo 183, August 1979
  Floyd, R.W.: Assigning meanings to programs. Proc. Am. Math. Soc. Symp. Appl. Math. 19, 19–31 (1967)MathSciNet CrossRef MATH
  Henderson, P., Morris, J.M.: A lazy evaluator. In: Proceedings 3rd POPL Symposium, Atlanta, Georgia (1976)
  Hoare, C.A.R.: An axiomatic basis for computer programming. CACM 12(10), 567–583 (1969)CrossRef MATH
  Holloway, J., Steele, G., Sussman, G.J., Bell, A.: The scheme 79 Chip. In: Proceedings LISP Conference, Stanford (1980)
  Kuo, S.S., Linck, M.H., Saadat, S.: A guide to CSP. Oxford University Programming Research Group, Technical Monograph PRG-14, August 1978
  McCarthy, J., et al.: LISP 1.5 Programmers Manual. MIT Press, Cambridge (1962)
  Quine, W.V.O.: Word and Object. MIT Press, Cambridge (1960)MATH
  Russell, B., Whitehead, A.N.: Principia Mathematica. Cambridge University Press, Cambridge (1925)
  Treleaven, P.C.: Exploiting program concurrency in computing systems. IEEE Computer, pp. 42–50, January 1979
  Turner, D.A.: SASL Language Manual. St Andrews University Department of Computational Science Technical report (1976)
  Turner, D.A.: Aspects of the Implementation of Programming Languages. Oxford University D. Phil. thesis (1981)
  Turner, D.A.: Recursion equations as a programming language. In: Darlington et al., pp. 1–28. Cambridge University Press, Cambridge (1982)
  
• 作者单位：D. A. Turner (17)
  
  17. Computing Laboratory, University of Kent, Canterbury, UK
  
• 丛书名：A List of Successes That Can Change the World
• ISBN：978-3-319-30936-1
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

This paper was written in 1981 and published in Darlington Henderson and Turner (1982) pp 1–28. The volume comprised the lecture notes from a summer school on Functional Programming held at Newcastle University in July 1981, attended by 80 people. The paper includes an overview of Kent Recursive Calculator, a simple functional programming system based on higher order recursion equations and a series of programming examples. It is probably the earliest paper using list comprehensions applied to lazy lists and has the first published account of the “list of successes” method of eliminating backtracking, here applied to the eight queens problem. The method didn’t yet have a name. It was Phil Wadler who saw its importance and coined the phrase “list of successes” in his 1985 paper. It was also Phil who invented the term “list comprehensions” for what are here called “ZF expressions”.