David Turner (computer scientist)

David A. Turner (born 1946) is a British computer scientist. He is best known for designing and implementing three programming languages, including the first for functional programming based on lazy evaluation, combinator graph reduction, and polymorphic types: SASL (1972), Kent Recursive Calculator (KRC) (1981), and the commercially supported Miranda (1985). Miranda had a strong influence on the later Haskell.[1]

For other people named David Turner, see David Turner (disambiguation).

David A. Turner
Born1946 (age 74–75)
CitizenshipUnited Kingdom
EducationD.Phil., University of Oxford
Known forSASL, Kent Recursive Calculator, Miranda
Scientific career
FieldsComputer science
InstitutionsQueen Mary University of London
University of Texas at Austin
University of Kent at Canterbury
Middlesex University
Websitewww.cs.kent.ac.uk/people/staff/dat

He has a Doctor of Philosophy (D.Phil.) from the University of Oxford. He has held professorships at Queen Mary College, London, University of Texas at Austin and the University of Kent at Canterbury, where he has spent most of his career and retains the title of Emeritus Professor of Computation.

He was involved with developing international standards in programming and informatics, as a member of the International Federation for Information Processing (IFIP) IFIP Working Group 2.1 on Algorithmic Languages and Calculi,[2] which specified, maintains, and supports the programming languages ALGOL 60 and ALGOL 68.[3]

He is also an Emeritus Professor at Middlesex University, England.

Publications
  • Turner, David A. SASL language manual. Tech. rept. CS/75/1. Department of Computational Science, University of St. Andrews 1975.
  • Turner, D.A. (1979). "A New Implementation Technique for Applicative Languages". Software - Practice and Experience. 9: 31. doi:10.1002/spe.4380090105.
  • Another Algorithm for Bracket Abstraction, D. A. Turner, Journal of Symbolic Logic, 44(2):267–270, 1979.
  • Functional Programming and its Applications, D. A. Turner, Cambridge University Press 1982.
  • A Parser Generator for use with Miranda, ACM Symposium on Applied Computing, pages 401–407, Philadelphia, USA, Feb 1996.
  • Elementary Strong Functional Programming, D. A. Turner, in R. Plasmeijer, P. Hartel, eds, "First International Symposium on Functional Programming Languages in Education", Lecture Notes in Computer Science, volume 1022, pages 1–13, Springer-Verlag, 1996.
  • Ensuring Streams Flow, Alastair Telford and David Turner, in Johnson, ed., "Algebraic Methodology and Software Technology", 6th International Conference, AMAST '97, Sydney Australia, December 1997, Lecture Notes in Computer Science, volume 1349, pages 509–523. AMAST, Springer-Verlag, December 1997.
  • Ensuring the Productivity of Infinite Structures, A.J.Telford, D.A.Turner, "Technical Report TR 14-97", 37 pages, Computing Laboratory, University of Kent, March 1998. Under submission to "Journal of Functional Programming".
  • Ensuring Termination in ESFP, A. J. Telford and D. A. Turner, in "15th British Colloquium in Theoretical Computer Science", page 14, Keele, April 1999. To appear in "Journal of Universal Computer Science".
  • A Hierarchy of Elementary Languages with Strong Normalisation Properties, A.J.Telford, D.A.Turner, "Technical Report TR 2-00", 66 pages, University of Kent Computing Laboratory, January 2000.
  • Total Functional Programming, Keynote address, pp 1–15, SBLP 2004, Rio de Janeiro, May 2004.
  • Church's Thesis and Functional Programming, in A. Olszewski ed., "Church's Thesis after 70 years'", pages 518-544, Ontos Verlag, 2006.

References
  1. Hudak, Paul; Hughes, John (2007). "A History of Haskell: being lazy with class".
  2. Jeuring, Johan; Meertens, Lambert; Guttmann, Walter (17 August 2016). "Profile of IFIP Working Group 2.1". Foswiki. Retrieved 14 October 2020.
  3. Swierstra, Doaitse; Gibbons, Jeremy; Meertens, Lambert (2 March 2011). "ScopeEtc: IFIP21: Foswiki". Foswiki. Retrieved 14 October 2020.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.