Higher-order + Polymorphic = Reusable

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

Postscript (zip) Language: English
Download this file (Postscript/21kB)
Request a format suitable for use with assistive technology e.g. a screenreader
Other Language: English
Download this file (Other/57kB)
Request a format suitable for use with assistive technology e.g. a screenreader
PDF Language: English
Download this file (PDF/77kB)	Preview
Request a format suitable for use with assistive technology e.g. a screenreader

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:	Reports and Papers (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:	05 Nov 2024 09:59 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/21504 (The current URI for this page, for reference purposes)

University of Kent Author Information

Thompson, Simon.

Creator's ORCID:	https://orcid.org/0000-0002-2350-301X
CReDIT Contributor Roles:

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.