| Carl Hewitt | |
| Birth Date: | [1] |
| Death Place: | Aptos, California |
| Fields: | Computer science Mathematical logic Model of computation Programming languages Philosophy of logic |
| Workplaces: | MIT Keio University Stanford University |
| Alma Mater: | MIT |
| Doctoral Advisor: | Seymour Papert |
| Academic Advisors: | Marvin Minsky Mike Paterson |
| Doctoral Students: | Gul Agha Henry Baker William Clinger Irene Greif Akinori Yonezawa |
| Known For: | Actor model Inconsistency robustness Planner (logic programs) Comparative schematology |
Carl Eddie Hewitt (; 1944 – 7 December 2022)[2] was an American computer scientist who designed the Planner programming language for automated planning[3] and the actor model of concurrent computation,[4] which have been influential in the development of logic, functional and object-oriented programming. Planner was the first programming language based on procedural plans invoked using pattern-directed invocation from assertions and goals. The actor model influenced the development of the Scheme programming language,[5] the π-calculus,[6] and served as an inspiration for several other programming languages.[7]
Hewitt obtained his PhD in mathematics at MIT in 1971, under the supervision of Seymour Papert, Marvin Minsky, and Mike Paterson. He began his employment at MIT that year,[8] and retired from the faculty of the MIT Department of Electrical Engineering and Computer Science during the 1999–2000 school year.[9] He became emeritus in the department in 2000.[10] Among the doctoral students that Hewitt supervised during his time at MIT are Gul Agha, Henry Baker, William Clinger, Irene Greif, and Akinori Yonezawa.[11]
From September 1989 to August 1990, Hewitt was the IBM Chair Visiting Professor in the Department of Computer Science at Keio University in Japan.[12] He has also been a visiting professor at Stanford University.
Hewitt was best known for his work on the actor model of computation. For the last decade, his work had been in "inconsistency robustness", which aims to provide practical rigorous foundations for systems dealing with pervasively inconsistent information.[13] This work grew out of his doctoral dissertation focused on the procedural (as opposed to logical) embedding of knowledge, which was embodied in the Planner programming language.
His publications also include contributions in the areas of open information systems,[14] organizational and multi-agent systems,[15] logic programming,[3] concurrent programming, paraconsistent logic[16] and cloud computing.[17]
See main article: Planner (programming language). The Planner language was developed during the late 1960s as part of Hewitt's doctoral research in MIT's Artificial Intelligence Laboratory. Hewitt's work on Planner introduced the notion of the "procedural embedding of knowledge",[18] which was an alternative to the logical approach to knowledge encoding for artificial intelligence pioneered by John McCarthy.[19] Planner has been described as "extremely ambitious".[20] A subset of Planner called Micro-Planner was implemented at MIT by Gerry Sussman, Drew McDermott, Eugene Charniak and Terry Winograd[21] and was used in Winograd's SHRDLU program,[22] Charniak's natural language story understanding work,[23] and L. Thorne McCarty's work on legal reasoning.[24] Planner was almost completely implemented in Popler[25] by Julian Davies at Edinburgh. Planner also influenced the later development of other AI research languages such as Muddle and Conniver,[20] as well as the Smalltalk object-oriented programming language.[26]
Hewitt's own work on Planner continued with Muddle (later called MDL), which was developed in the early 1970s by Sussman, Hewitt, Chris Reeve, and David Cressey as a stepping-stone towards a full implementation of Planner. Muddle was implemented as an extended version of Lisp, and introduced several features that were later adopted by Conniver, Lisp Machine Lisp, and Common Lisp.[20] However, in late 1972 Hewitt abruptly halted his development of the Planner design in his thesis, when he and his graduate students invented the actor model of computation.
See main article: Actor model. Hewitt's work on the actor model of computation spanned over 30 years, beginning with the introduction of the model in a 1973 paper authored by Hewitt, Peter Bishop, and Richard Steiger,[27] and including new results on actor model semantics published as recently as 2006.[28] Much of this work was carried out in collaboration with students in Hewitt's Message Passing Semantics Group at MIT's Artificial Intelligence Lab.[29]
Sussman and Steele developed the Scheme programming language in an effort to gain a better understanding of the actor model. They discovered that their operator to create an actor, ALPHA, and their operator to create a function, LAMBDA, were identical, so they only kept LAMBDA for both.[30] [31] A number of other programming languages were developed to specifically implement the actor model, such as ACT-1,[32] SALSA,[33] Caltrop,[34] E[7] and ActorScript.[35] The actor model also influenced the development of the π-calculus.[36] (See actor model and process calculi history.)