论文信息 - Higher-order + Polymorphic = Reusable

Higher-order + Polymorphic = Reusable

This paper explores how certain ideas in object oriented languages have their correspondents in functional languages. In particular we look at the analogue of the iterators of the C++ standard template library. We also give an example of the use of constructor classes which feature in Haskell 1.3 and Gofer.

Simon Thompson

[1] James Wong. COMPUTER SCIENCE DEPARTMENT , 1971 .

[2] D. A. Turner,et al. Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[3] J. Goguen. Higher-order functions considered unnecessary for higher-order programming , 1990 .

[4] Alexander A. Stepanov,et al. Algorithm‐oriented generic libraries , 1994, Softw. Pract. Exp..

[5] Mark P. Jones. A system of constructor classes: overloading and implicit higher-order polymorphism , 1993, FPCA '93.

[6] Robin Milner,et al. Definition of standard ML , 1990 .

[7] WadlerPhilip,et al. Report on the programming language Haskell , 1992 .

[8] Simon L. Peyton Jones,et al. Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[9] J. Davenport. Editor , 1960 .

[10] Denis Johnson. In Palo Alto , 1982 .