Matthew Flatt

Matthew Flatt

Matthew Flatt is a computer scientist, currently teaching at the University of Utah (Salt Lake City). He is also a member of the PLT group and, as such, responsible for the creation and maintenance of Racket.

Flatt received his PhD at Rice University under the direction of Matthias Felleisen. 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.

Flatt's presentations are well known in the functional programming community for their executable and meta-circular nature. He is known to implement his presentations as Racket programs and to demonstrate this fact by executing the talk on the talk or for creating the talk during the talk.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Racket (programming language) — Racket Paradigm(s) Multi paradigm: Functional, Procedural, Modular, Object oriented, Reflective, Meta Appeared in 1994 Developer …   Wikipedia

  • PLT Scheme — Infobox Software name = PLT Scheme caption = developer = PLT latest release version = 4.1 latest release date = Release date and age|2008|08|12 latest preview version = latest preview date = operating system = Cross platform platform = x86, PPC,… …   Wikipedia

  • Functional programming — In computer science, functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state and mutable data. It emphasizes the application of functions, in contrast with the… …   Wikipedia

  • Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… …   Wikipedia

  • How to Design Programs — (HtDP) is a textbook by Matthias Felleisen, Robert Bruce Findler, Matthew Flatt and Shriram Krishnamurthi on the systematic design of computer programs published in 2001 by MIT Press. The book introduces the concept of a design recipe , a six… …   Wikipedia

  • Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… …   Wikipedia

  • Essentials of Programming Languages — (MIT Press, 2001. 2nd edition, ISBN 0 262 06217 8) is a book by Daniel P. Friedman, Mitchell Wand and Christopher T. Haynes on programming languages.EoPL is a text book that surveys the principles of programming languages from an operational… …   Wikipedia

  • The Structure and Interpretation of the Computer Science Curriculum — is a monograph published in 2004 [Journal of Functional Programming, Volume 14 , Issue 4 (July 2004) Pages: 365 378 ] by Matthias Felleisen, Robert Bruce Findler, Matthew Flatt and Shriram Krishnamurthi comparing and contrasting the pedagogical… …   Wikipedia

  • ISWIM — ist eine von Peter J. Landin konzipierte Programmiersprache und eine Abkürzung von »If you See What I Mean«. Landin stellte seine Ideen auf einer Konferenz im August 1965 vor. Dieser Vortrag wurde unter dem Titel The Next 700 Programming… …   Deutsch Wikipedia

  • The Beverly Hillbillies — For the 1993 film, see The Beverly Hillbillies (film). The Beverly Hillbillies b w title screen Format sitcom Created by …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”