Matthew Flatt is an American computer scientist and professor at the University of Utah School of Computing in Salt Lake City.[1] He is also a member of the core development team for the Racket programming language.[2]

Flatt received his PhD at Rice University in 1999, under the direction of Matthias Felleisen.[3] His dissertation is on the mechanics of first-class modules and mixin classes. His work triggered research in the ML community on mutually recursive modules and in the object-oriented community on mixins and traits.

Flatt served as one of four editors of the Revised^6 Report on the Scheme programming language. The report is influenced by his design of Racket, especially the module system, the exception system, the record system, the macro system, and library links.[4]

References

  1. ↑ University of Utah Computer Science faculty listing, retrieved 2015-02-16.
  2. ↑ Racket: People, retrieved 2012-06-22.
  3. ↑ Matthew Flatt at the Mathematics Genealogy Project
  4. ↑ Flatt, Matthew (2002-09-17). "Composable and compilable macros". Proceedings of the seventh ACM SIGPLAN international conference on Functional programming. ICFP '02. New York, NY, USA: Association for Computing Machinery. pp. 72–83. doi:10.1145/581478.581486. ISBN 978-1-58113-487-2. S2CID 2203273.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.