Rod Burstall

Last updated

Rod Burstall
BornNovember 1934 (1934-11) (age 89)
Liverpool, England
Alma mater University of Cambridge
University of Birmingham
Known for COWSEL (renamed POP-1), POP-2, NPL, Hope
Awards ACM SIGPLAN 2009 Programming Language Achievement Award
Scientific career
Fields Computer science
Institutions University of Edinburgh
Doctoral advisor N. A. Dudley
K. Brian Haley [1]
Doctoral students Thorsten Altenkirch
John Darlington
Mike Gordon
Conor McBride
J Strother Moore
Alan Mycroft
Gordon Plotkin
Don Sannella
Website https://web.archive.org/web/20210225112350/http://www.freewebs.com/rodburstall/

Rodney Martineau "Rod" Burstall (born 1934) is a British computer scientist and one of four founders of the Laboratory for Foundations of Computer Science at the University of Edinburgh. [2]

Contents

Biography

Burstall studied physics at the University of Cambridge, then an M.Sc. in operational research at the University of Birmingham. He worked for three years before returning to Birmingham University [3] to earn a Ph.D. in 1966 with thesis titled Heuristic and Decision Tree Methods on Computers: Some Operational Research Applications under the supervision of N. A. Dudley and K. B. Haley. [1]

Burstall was an early and influential proponent of functional programming, pattern matching, and list comprehension, and is known for his work with Robin Popplestone on COWSEL (renamed POP-1) and POP-2, innovative programming languages developed at the University of Edinburgh around 1970, and later work with John Darlington on NPL and program transformation and with David MacQueen and Don Sannella on Hope, a precursor to Standard ML, Miranda, and Haskell. [4]

In 1995, he was elected a Fellow of the Royal Society of Edinburgh. [5]

Burstall retired in 2000, becoming Professor Emeritus.

In 2002 David Rydeheard and Don Sannella assembled a festschrift for Burstall that was published in Formal Aspects of Computing. [4]

In 2009, he was awarded the Association for Computing Machinery (ACM) SIGPLAN Programming Language Achievement Award. [6] [7]

Books

Related Research Articles

The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membership group, reporting nearly 110,000 student and professional members as of 2022. Its headquarters are in New York City.

<span class="mw-page-title-main">Tony Hoare</span> British computer scientist

Sir Charles Antony Richard Hoare, also known as Tony Hoare or by his initials C. A. R. Hoare is a British computer scientist who has made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing. His work earned him the Turing Award, usually regarded as the highest distinction in computer science, in 1980.

Hope is a small functional programming language developed in the 1970s at the University of Edinburgh. It predates Miranda and Haskell and is contemporaneous with ML, also developed at the University. Hope was derived from NPL, a simple functional language developed by Rod Burstall and John Darlington in their work on program transformation. NPL and Hope are notable for being the first languages with call-by-pattern evaluation and algebraic data types.

Extended ML is a general-purpose, high-level, wide-spectrum programming language based on the languages ML and Standard ML, covering both program specification and implementation. It extends the syntax of ML to include axioms, which do not need to be executable but can rigorously specify the behavior of a program. With this addition, the language can be used for stepwise refinement, proceeding gradually from an initial formal specification to eventually yield an executable Standard ML program. Correctness of the final executable with respect to the original specification can then be established by proving the correctness of each of the refinement steps. Extended ML is used for research into and teaching of formal methods in program development and specification, and research into automatic program verification.

SIGPLAN is the Association for Computing Machinery's Special Interest Group on programming languages.

<span class="mw-page-title-main">Xavier Leroy</span> French computer scientist and programmer (born 1968)

Xavier Leroy is a French computer scientist and programmer. He is best known for his role as a primary developer of the OCaml system. He is Professor of software science at Collège de France. Before his appointment at Collège de France in 2018, he was senior scientist at the French government research institution Inria.

<span class="mw-page-title-main">Matthias Felleisen</span> German-American computer science professor and author

Matthias Felleisen is a German-American computer science professor and author. He grew up in Germany and immigrated to the US in his twenties. He received his PhD from Indiana University Bloomington under the direction of Daniel P. Friedman.

<span class="mw-page-title-main">Gordon Plotkin</span> Computer Scientist

Gordon David Plotkin is a theoretical computer scientist in the School of Informatics at the University of Edinburgh. Plotkin is probably best known for his introduction of structural operational semantics (SOS) and his work on denotational semantics. In particular, his notes on A Structural Approach to Operational Semantics were very influential. He has contributed to many other areas of computer science.

<span class="mw-page-title-main">John C. Reynolds</span> American computer scientist (1935–2013)

John Charles Reynolds was an American computer scientist.

Luca Andrea Cardelli is an Italian computer scientist who is a research professor at the University of Oxford, UK. Cardelli is well known for his research in type theory and operational semantics. Among other contributions, in programming languages, he helped design the language Modula-3, implemented the first compiler for the (non-pure) functional language ML, defined the concept of typeful programming, and helped develop the experimental language Polyphonic C#.

Mark N. Wegman is an American computer scientist known for his contributions to algorithms and compiler optimization. Wegman received his B.A. from New York University and his Ph.D. from the University of California, Berkeley. He joined IBM Research in 1975, where he currently serves as head of Computer Science. He is a member of the IBM Academy of Technology and a Fellow of the Association for Computing Machinery (1996) and the Institute of Electrical and Electronics Engineers. He became an IBM Fellow in 2007. He was elected to the National Academy of Engineering in 2010.

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

<span class="mw-page-title-main">George Necula</span> Romanian computer scientist

George Ciprian Necula is a Romanian computer scientist, engineer at Google, and former professor at the University of California, Berkeley who does research in the area of programming languages and software engineering, with a particular focus on software verification and formal methods. He is best known for his Ph.D. thesis work first describing proof-carrying code, a work that received the 2007 SIGPLAN Most Influential POPL Paper Award.

<span class="mw-page-title-main">Paul Hudak</span> American computer scientist

Paul Raymond Hudak was an American musician and professor of computer science at Yale University who was best known for his involvement in the design of the programming language Haskell, and for several textbooks on Haskell and computer music. He was a chair of the department, and was also master of Saybrook College. He died on April 29, 2015, of leukemia.

Mary Lou Ehnot Soffa is an American computer scientist noted for her research on compilers, program optimization, system software and system engineering.

Barbara G. Ryder is an American Computer Scientist noted for her research on programming languages and more specifically, the theoretical foundations and empirical investigation of interprocedural compile-time analysis.

<span class="mw-page-title-main">Laurie Hendren</span> Canadian computer scientist (1958–2019)

Laurie Hendren was a Canadian computer scientist noted for her research in programming languages and compilers, and for her advocacy for patients to have access their health data in Quebec.

<span class="mw-page-title-main">Kathleen Fisher</span> American computer scientist

Kathleen Shanahan Fisher is an American computer scientist who specializes in programming languages and their implementation.

<span class="mw-page-title-main">John Darlington</span> British academic and author

John Darlington is a British academic, researcher and author. He is an Emeritus Professor at Imperial College London. He was Director of the London e-Science Centre and was head of the Functional Programming and Social Computing Sections at Imperial.

References

  1. 1 2 Rod Burstall at the Mathematics Genealogy Project
  2. Kerse, Eleanor (2002). "Ode to Rod Burstall". Formal Aspects of Computing. 13 (3–5). Springer Science+Business Media: 194. doi:10.1007/s001650200007. S2CID   917027.
  3. "Rod Burstall's home page". University of Edinburgh. Retrieved 31 October 2012.
  4. 1 2 D. Rydeheard & Don Sannella (July 2002) "A Collection of Papers and Memoirs Celebrating the Contribution of Rod Burstall to Advances in Computer Science", Formal Aspects of Computing 13(3-5): 187–193 doi : 10.1007/s001650200006
  5. "Professor Rodney Martineau Burstall FRSE – The Royal Society of Edinburgh". The Royal Society of Edinburgh. Retrieved 12 March 2018.
  6. "SIGPLAN Programming Languages Achievement Award – 2009: Rod Burstall". Association for Computing Machinery (ACM) SIGPLAN . Retrieved 22 September 2012.
  7. Wallace, Malcolm. "SIGPLAN Programming Languages Achievement Award: Rod Burstall". Vimeo . Retrieved 22 September 2012. Introduced by Philip Wadler.{{cite web}}: CS1 maint: postscript (link)