Total functional programming

Journal of Universal Computer Science

Volumn 10, Issue 7, 2004, Pages 751-768

  Turner, D A ^a  

^a MIDDLESEX UNIVERSITY   (United Kingdom)

Author keywords

Functional programming

Indexed keywords

EID: 23844555812     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. [Abel 1999] Andreas Abel "A Semantic Analysis of Structural Recursion", Diploma Dissertation, 50 pages, Ludwigs-Maximillians- University, Munich, February 1999.
2. [Arkoudas and McAllester 1996] Kostas Arkoudas, David McAllester "Walther Recursion", Proceedings CADE 13, Springer LNCS 1104:643-657, 1996.
3. [Bird and Wadler 1988] R. S. Bird, P. Wadler "Introduction to Functional Programming", Prentice Hall, 1988.
4. [Gödel 1958] K. Gödel "On a hitherto unutilized extension of the finitary standpoint", Dialectica 12, 280-287 (1958).
5. [Harper et el. 1986] R. Harper, D. MacQueen, R. Milner "Standard ML", University of Edinburgh LFCS Report 86-2, 1986.
6. [Hudak et al. 1992] Paul Hudak et al. "Report on the Programming Language Haskell", SIGPLAN Notices, 27(5), May 1992.
7. [McBride 2003] Conor McBride "First Order Unification by Structural Recursion", Journal of Functional Programming 13(6): 1061-1075, November 2003.
8. [Nordstrom et al. 1990] B. Nordstrom, K. Petersson, J. M. Smith "Programming in Martin-Lofs Type Theory: An Introduction", Oxford Science Publications, 1990.
9. [Pitts 1994] A. M. Pitts "A Co-induction Principle for Recursively Defined Domains", Theoretical Computer Science, 124(2): 195-219, 1994.
10. [Runciman 1989] Colin Runciman "What about the Natural Numbers", Computer Languages, 14(3):181-191, 1989.
11. [Telford and Turner 1997] A.J.Telford, D.A.Turner "Ensuring Streams Flow", Johnson, ed, Algebraic Methodology and Software Technology - AMAST '97, Sydney, Australia, December 1997 (Springer LNCS vol 1349:509-523).
12. [Telford and Turner 2000] A.J.Telford, D.A.Turner "Ensuring Termination in ESFP", Journal of Universal Computer Science, 6(4):474-488, April 2000.
13. [Turner 1982] D. A. Turner "Functional Programming and Proofs of Program Correctness" in Tools and Notions for Program Construction, pp 187-209, Cambridge University Press, 1982 (ed. Néel).
14. [Turner 1985] D. A. Turner "Miranda: A non-strict functional language with polymorphic types" Proceedings IFIP International Conference on Functional Programming Languages and Computer Architecture, Nancy, France, September 1985 (Springer LNCS, vol 201:1-16).
15. [Turner 1995] D.A.Turner "Elementary Strong Functional Programming". In R.Plasmeijer, P.Hartel, eds, First International Symposium on Functional Programming Languages in Education, Nijmegen, NL, Dec 1995 (Springer LNCS, vol 1022:1-13).
16. [Wadler et al. 1998] Philip Wadler, Walid Taha, David McQueen "How to add laziness to a strict language without even being odd", 7 pages, Workshop on Standard ML, Baltimore, September 1998.