Higher-order + Polymorphic = Reusable

Thompson, Simon (1997) Higher-order + Polymorphic = Reusable. Other. University of Kent (Unpublished) (KAR id:21504)

Postscript (zip) Language: English
Download (21kB)
This file may not be suitable for users of assistive technology. Request an accessible format
Other Language: English
Download (57kB)
This file may not be suitable for users of assistive technology. Request an accessible format
PDF Language: English
Download (77kB) Preview	Preview
This file may not be suitable for users of assistive technology. Request an accessible format

Abstract

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.

Item Type:	Monograph (Other)
Uncontrolled keywords:	higher-order, polymorphic, iterator, constructor class, C++, functional programming
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Mark Wheadon
Date Deposited:	26 Jul 2009 16:53 UTC
Last Modified:	16 Nov 2021 09:59 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/21504 (The current URI for this page, for reference purposes)
Thompson, Simon:	https://orcid.org/0000-0002-2350-301X

Depositors only (login required):