Simon Thompson (professor)

Appearance move to sidebar hide

Simon Thompson
BornUnited Kingdom
EducationD.Phil., University of Oxford, 1984
Known forFunctional programming research,
Cardano domain-specific languages: Marlowe
Scientific career
FieldsComputer science
InstitutionsUniversity of Kent
Input Output Global
ThesisRecursion theories on the continuous functionals (1984)
Doctoral advisorRobin Oliver Gandy

Simon Thompson is a research computer scientist, author, and an emeritus professor of the University of Kent, specializing in logic and computation. His research into functional programming covers software verification and validation, programming tool-building, and software testing for the functional programming languages Erlang, Haskell, and OCaml. He is the author of books on data type theory, Miranda, Haskell, and Erlang, and runs a massive open online course about Erlang for FutureLearn.

Education

Thompson earned a Doctor of Philosophy (D.Phil.) from the University of Oxford in 1984 with a dissertation titled "Recursion theories on the continuous functionals". Thompson's doctoral adviser was Robin Oliver Gandy.

Work

As of 2019, he worked for Input Output Global, Input Output Hong Kong on domain-specific languages for the Cardano blockchain platform. There, he developed a specialised smart contract language, Marlowe, designed for non-programmers working in the financial sector.

Books

His books include:

References

  1. ^ Thompson, Simon (20 October 2023). "Professor Simon Thompson". University of Kent: School of Computing. Canterbury, Kent, England.
  2. ^ Bereczky, Péter; Horpácsi, Dániel; Thompson, Simon (23 August 2020). Machine-Checked Natural Semantics for Core Erlang: Exceptions and Side Effects. International Conference on Functional Programming (ICFP). Online – via ACM SIGPLAN.
  3. ^ Thompson, Simon (May 1997). Higher-order + Polymorphic = Reusable (Report). Canterbury, Kent: School of Computing, University of Kent. Retrieved 30 December 2023.
  4. ^ Li, Huiqing; Thompson, Simon; Reinke, Claus (April 2005). "The Haskell Refactorer: HaRe, and its API". In Boyland, John Tang; Hedin, Görel (eds.). Proceedings of the 5th workshop on Language Descriptions, Tools and Applications. Canterbury, Kent: School of Computing, University of Kent. pp. 182–196. Retrieved 30 December 2023.
  5. ^ Rowe, Reuben N. S.; Thompson, Simon (8 September 2017). ROTOR: First Steps Towards a Refactoring Tool for OCaml. International Conference on Functional Programming (ICFP). Phoenix, Arizona – via ACM SIGPLAN.
  6. ^ Rowe, Reuben N. S.; Férée, Hugo; Thompson, Simon; Owens, Scott (25 June 2019). Characterising Renaming within OCaml's Module System: Theory and Implementation. Programming Language Design and Implementation (PLDI). Phoenix, Arizona – via ACM SIGPLAN.
  7. ^ Harrison, Joseph; Varoumas, Steven; Thompson, Simon; Rowe, Reuben (28 August 2020). API migration: compare transformed. International Conference on Functional Programming (ICFP). Online – via ACM SIGPLAN.
  8. ^ Thompson, Simon (June 1985). "Axiomatic Recursion Theory and the Continuous Functionals". Journal of Symbolic Logic. 50 (2). New York, New York: 442–450. doi:10.2307/2274232. JSTOR 2274232. S2CID 26299352 – via JSTOR.
  9. ^ "Mathematics Genealogy Project". North Dakota State University: Department of Mathematics.
  10. ^ "IOHK: Team: Prof Simon Thompson: Technical Project Director Research". Input Output. n.d. Archived from the original on 28 November 2022.
  11. ^ Input Output Hong Kong (11 December 2018). "Marlowe: financial contracts on blockchain". Input Output Hong Kong.
  12. ^ Lamela Seijas, Pablo; Nemish, Alexander; Smith, David; Thompson, Simon (2020). "Marlowe: Implementing and Analysing Financial Contracts on Blockchain". Financial Cryptography and Data Security. Cham: Springer International Publishing: 496–511. doi:10.1007/978-3-030-54455-3_35. ISBN 978-3-030-54455-3.
  13. ^ "Miranda: A Non-strict, Polymorphic, Functional Language". 2010.
  14. ^ Richards, Hamilton (November 1998). "Book reviews" (PDF). Journal of Functional Programming. 8 (6): 633–637. doi:10.1017/S0956796898213220.

External links