Inventing language

November 10, 2009 by Larry Hardesty Inventing language

Enlarge

Institute Professor and Associate Provost for Faculty Equity Barbara Liskov. Photo: Donna Coveney

(PhysOrg.com) -- Last Thursday, the day after the New York Yankees won their first World Series of the 21st century, MIT Institute Professor Barbara Liskov, the 2008 recipient of the Turing Award — frequently called the Nobel Prize for computer science — delivered the first lecture of the 2009 Dertouzos Lecture Series.

John Guttag, the Dugald C. Jackson Professor in the Department for and , introduced Liskov, and he greeted the crowd of more than 150 people wearing a Yankees cap. The cap, he claimed, had a purpose other than pouring salt in the wounds of disappointed Boston Red Sox fans: His PowerPoint presentation was titled “Barbara Liskov: the Derek Jeter of Computer Science” — a reference to the Yankees’ star shortstop that drew hisses from the audience. Guttag’s presentation also featured photos of Liskov dressed in renaissance clothing and putting a tray of cookies in the oven — “moonlighting as a baker to put her son through Harvard,” Guttag said, “which was all the more poignant, since he could have gone to MIT for free.”

Guttag waxed serious long enough to describe Liskov as one of his own most valued mentors, and then Liskov took the podium. She opened with a joke of her own: In large part, her Turing Award honored work she had done in the 1970s, laying down principles for the organization of programming languages that today are almost universally followed. After the award was announced, she said, her husband spent a lot of time on the computer Googling the reaction, and at some point, “he came upon a quote from someone who said, ‘What did she get this award for? Everyone knows this, anyway.’”

After that, Liskov was all business. The thrust of her talk was that, in the 1970s, it was emphatically not the case that “everyone knew this,” and she described in great detail the intellectual environment in which she did her pioneering work. The talk was not for the uninitiated: she began by describing several papers from the early 1970s from which she had drawn inspiration — with titles like “Go To Statement Considered Harmful” and “Information Distribution Aspects of Design Methodology” — but first conceded to the audience that while “many of you have read them, I’m not sure all of you have.”

Liskov explained that, in the fall of 1972, after reviewing the literature in the field, she came up with the idea for what today are called abstract data types. Traditionally, a computer program would be a long list of exhaustively detailed instructions, and anyone reading the code — including the original programmer — could easily get lost. Abstract data types are, effectively, repositories for the computational details of the program, which let the programmer concentrate on the big picture. A complicated program turns into some rather simple interactions between the abstract data types. And indeed, the programmer can later change the details of the data types’ instantiation — how they do their low-level computations — without changing the overall structure of the program.

Liskov explained how, after coming up with the idea of abstract data types, she and some collaborators created a programming language, CLU, which put some of her ideas into practice. The rest of her talk was largely a demonstration that CLU prefigured most of the ideas that are commonplace in today’s programming languages — ideas with names like polymorphism, type hierarchy, and exception handling.

During the question-and-answer session that followed the talk, Liskov was asked the secret of her success. Part of her answer — which must have chagrined some members of the audience — was that “I don’t work that many hours a day.” “I always went home at night, and didn’t work in the evening,” she said. “I always found that downtime to be really useful.” She also, however, emphasized the importance of pursuing research that’s interesting — rather than, say, the research that will generate the most publications. That way, she said, “at the end, if you fail, at least you did something interesting, rather than doing something boring and also failing.” After the laughter died down, she added, “Or doing something boring and then forgetting how to do something interesting.”

Provided by Massachusetts Institute of Technology (news : web)


print this article email this article download pdf blog this article bookmark this article     Stumble it Digg this share on Facebook retweet share on Reddit add to delicious
Rate this story - 5 /5 (1 vote)


November 10, 2009 all stories

Comments: 0

5 /5 (1 vote)
  • Stumble this up

  • Digg this

  • share this

  • hide
  • Related Stories

  • Yale Professor wins Godel Prize for showing how computer algorithms solve problems
    created Aug 13, 2008 | popularity not rated yet | comments 0
  • Epilepsy breakthrough on horizon
    created Aug 31, 2006 | popularity not rated yet | comments 0
  • Goodbye to faulty software?
    created Jul 15, 2008 | popularity not rated yet | comments 0
  • New approach eliminates software deadlocks using discrete control theory
    created Dec 02, 2008 | popularity not rated yet | comments 0
  • New algorithm found for learning languages
    created Sep 06, 2005 | popularity not rated yet | comments 0



  • hide
  • Relevant PhysicsForums posts

  • power calculations ..can you check?
    created 2 hours ago
  • Magnet bullet sheild.
    created 12 hours ago
  • Distance and time required to stop a sliding unit?
    created Dec 06, 2009
  • Help understanding
    created Dec 04, 2009
  • TKPH rating calculation
    created Dec 02, 2009
  • How To Convert F to Q?
    created Dec 02, 2009
  • More from Physics Forums - General Engineering

Other News

Facebook (and systems biologists) take note: Network analysis reveals true connections

Facebook (and Systems Biologists) Take Note: Network Analysis Reveals True Connections

Technology / Computer Sciences

created 8 hours ago | popularity 3.5 / 5 (4) | comments 3

(PhysOrg.com) -- Facebook figures out that you know Holly, although you haven't seen her in 10 years, because you have four mutual friends -- a good predictor of direct friendship. But sometimes Facebook gets ...


Google search results to include 'real-time' data (AP)

Google search results to include 'real-time' data

Technology / Internet

created 6 hours ago | popularity not rated yet | comments 0

(AP) -- Fresh information from blogs, news sites, Twitter and other popular hangouts will appear in Google's search results more quickly as the company aims to give people a more comprehensive look at what's ...


MIT wins Pentagon prize in social networking contest

MIT wins Pentagon prize in social networking contest

Technology / Other

created 6 hours ago | popularity not rated yet | comments 0

A team from the Massachusetts Institute of Technology (MIT) has won a 40,000-dollar prize for using social networking tools to identify the locations of 10 large weather balloons in a contest sponsored by ...


square

Swipe Your Credit Card on a Cell Phone

Technology / Hi Tech

created 7 hours ago | popularity 2 / 5 (2) | comments 0

(PhysOrg.com) -- With a small card reader that attaches to a cell phone, a new company is making it easier for small businesses and even individuals to accept credit card payments. The San Francisco start-up, ...


Google Chrome

Google Chrome extensions to be officially released

Technology / Internet

created 17 hours ago | popularity 3.8 / 5 (5) | comments 3

(PhysOrg.com) -- Google is expected to release its Extensions Gallery for general users of the new Chrome browser this week, possibly at the Add-On Conference on browser extensions to be held on December 11, ...