An introduction to the theory of lists

作者: Richard S. Bird

DOI: 10.1007/978-3-642-87374-4_1

关键词:

摘要: In these lectures we introduce a notation and calculus for specifying manipulating computable functions over lists. The is used to derive efficient solutions number of problems, including problems in text processing. Although programming per se not the main topic, indicate briefly how can be implemented purely functional language.

参考文章(7)
D. A. Turner, Recursion Equations as a Programming Language A List of Successes That Can Change the World. pp. 459- 478 ,(1982) , 10.1007/978-3-319-30936-1_24
L. Meertens, R. S. Bird, Two exercises found in a book on algorithmics The IFIP TC2/WG 2.1 Working Conference on Program specification and transformation. pp. 451- 457 ,(1987)
R. S. Bird, The promotion and accumulation strategies in transformational programming ACM Transactions on Programming Languages and Systems. ,vol. 6, pp. 487- 504 ,(1984) , 10.1145/1780.1781
R.S. Bird, John Hughes, The alpha-beta algorithm: an exercise in program transformation Information Processing Letters. ,vol. 24, pp. 53- 57 ,(1987) , 10.1016/0020-0190(87)90198-0
R.S. Bird, Transformational programming and the paragraph problem Science of Computer Programming. ,vol. 6, pp. 159- 189 ,(1986) , 10.1016/0167-6423(86)90023-7