Skip to main content

Elementary strong functional programming

Turner, David A. (1995) Elementary strong functional programming. In: Hartel, Pieter H. and Plasmeijer, Rinus, eds. Funtional Programming Languages in Education First International Symposium. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 1-13. ISBN 978-3-540-60675-8. E-ISBN 978-3-540-49252-8. (doi:10.1007/3-540-60675-0_35) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
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: Book section
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: Faculties > Sciences > School of Computing
Depositing User: I.T. Ekpo
Date Deposited: 25 Oct 2009 10:50 UTC
Last Modified: 06 Sep 2019 11:42 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/19100 (The current URI for this page, for reference purposes)
  • Depositors only (login required):