Total functional programming (Ofer Abarbanel online library)

Total functional programming (also known as strong functional programming,[1] to be contrasted with ordinary, or weak functional programming) is a programming paradigm that restricts the range of programs to those that are provably terminating.[2]

References

  1. ^This term is due to: Turner, D.A. (December 1995). Elementary Strong Functional Programming. First International Symposium on Functional Programming Languages in Education. Springer LNCS. 1022. pp. 1–13..
  2. ^ Jump up to:ab Turner, D.A. (2004-07-28), “Total Functional Programming”, Journal of Universal Computer Science, 10 (7): 751–768, doi:10.3217/jucs-010-07-0751
  3. ^Turner, D. A. (2000-04-28), “Ensuring Termination in ESFP”, Journal of Universal Computer Science, 6 (4): 474–488, doi:10.3217/jucs-006-04-0474
  4. ^The differences between lazy and eager evaluation are discussed in: Granström, J. G. (2011). Treatise on Intuitionistic Type Theory. Logic, Epistemology, and the Unity of Science. 7. ISBN 978-94-007-1735-0. See in particular pp. 86–91.
  5. ^Granström, J. G. (May 2012), “A New Paradigm for Component-based Development”, Journal of Software, 7 (5): 1136–1148, doi:10.4304/jsw.7.5.1136-1148[dead link] Archived copy

Ofer Abarbanel – Executive Profile

Ofer Abarbanel online library

Ofer Abarbanel online library

Ofer Abarbanel online library

Ofer Abarbanel online library