Work

Total Functional Programming

Year: 2004

Type: article

Abstract: . The driving idea of functional programming is to make programming more closely related to mathematics. A program in a functional language such as Haskell or Miranda consists of equations which are both computation rules and a basis for simple algebraic reasoning about the functions and data structures they define. The existing model of functional programming, although elegant and powerful, is compromised to a greater extent than is commonly recognised by the presence of partial functions. We consider a simple discipline of total functional programming designed to exclude the possibility of nontermination. Among other things this requires a type distinction between data, which is finite, and codata, which is potentially infinite. 1.

DOI: 10.3217/jucs-010-07-0751

Author: D. A. Turner

Institution: Middlesex University London

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2125743465

FWCI: 5.843

Cites: 14

Cited by: 75

Related to: 10