Turner, D.A. (1995) Elementary strong functional programming. In: 1st International Symposium on Functional Programming Languages in Education (FPLE 95), Dec 04-06, 1995, Nijmegen, Netherlands.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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:||Conference or workshop item (Paper)|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing|
|Depositing User:||I.T. Ekpo|
|Date Deposited:||25 Oct 2009 10:50|
|Last Modified:||25 Oct 2009 10:50|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/19100 (The current URI for this page, for reference purposes)|
- Depositors only (login required):