Total Functional Programming Export

@article{turner:tfp, 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 non-termination. Among other things this requires a type distinction between data, which is finite, and codata, which is potentially infinite.}, author = {Turner, D. A.}, citeulike-article-id = {4023285}, journal = {Journal of Universal Computer Science}, keywords = {functional-programming, logic, models-of-computation}, number = {7}, pages = {751--768}, pdf = {/literature/Turner2004.pdf}, posted-at = {2009-06-30 15:08:32}, priority = {0}, title = {Total Functional Programming}, volume = {10}, year = {2004} }

TY - JOUR ID - turner:tfp L3 - citeulike-article-id:4023285 N2 - 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 non-termination. Among other things this requires a type distinction between data, which is finite, and codata, which is potentially infinite. IS - 7 JF - Journal of Universal Computer Science EP - 768 TI - Total Functional Programming VL - 10 SP - 751 KW - functional-programming KW - logic KW - models-of-computation AU - Turner, DA PY - 2004/// ER -