Elementary strong functional programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1022, Issue , 1995, Pages 1-13

  Turner, D A ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

KEY FEATURE;

FUNCTIONAL PROGRAMMING;

EID: 84949511823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60675-0_35     Document Type: Conference Paper

References (9)

1. R. S. Bird, P. Wadler "Introduction to Functional Programming", Prentice Hall, 1988.
2. K. Gödel "On a hitherto unutilized extension of the finitary standpoint", Dialectica 12, pp 280-287 (1958).
3. R. Harper, D. MacQueen, R. Milner "Standard ML", University of Edinburgh LFCS Report 86-2, 1986.
4. Paul Hudak et al. "Report on the Programming Language Haskell", SIGPLAN Notices, vol 27, no 5 (May 1992).
5. A. M. Pitt "A Co-induction Principle for Recursively Defined Domains", Theoretical Computer Science, vol 124, 1994.
6. Colin Runciman "What about the Natural Numbers", Computer Languages vol 14, no 3, pp 181-191, 1989.
7. S. J. Thompson "A Logic for Miranda", Formal Aspects of Computing, vol 1, no 4, pp 339-365,1989.
8. 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).
9. D. A. Turner "Miranda: A non-strict functional language with polymorphic types" Proceedings IFEP International Conference on Functional Programming Languages and Computer Architecture, Nancy, France, September 1985 (LNCS, vol 201).