Skip to main content

Elementary strong functional programming

Turner, David A. (1995) Elementary strong functional programming. Functional Programming Languages in Education, 1022 . pp. 1-13. (doi:10.1007/3-540-60675-0_35) (KAR id:19100)

PDF Pre-print
Language: English
Download (231kB) Preview
[thumbnail of fple.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL
http://dx.doi.org/10.1007/3-540-60675-0_35

Abstract

Functional programming is a good idea, but we haven't got it quite right yet. What we have been doing up to now is weak (or partial) functional programming. What we should be doing is strong (or total) functional programming - in which all computations terminate. We propose an elementary discipline of strong functional programming. A key feature of the discipline is that we introduce a type distinction between data, which is known to be finite, and codata, which is (potentially) infinite.

Item Type: Article
DOI/Identification number: 10.1007/3-540-60675-0_35
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: David Turner
Date Deposited: 25 Oct 2009 10:50 UTC
Last Modified: 17 Jul 2021 16:27 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/19100 (The current URI for this page, for reference purposes)
  • Depositors only (login required):