Joe Stoy

Last updated

Joe Stoy
Joe Stoy.jpg
Joe Stoy speaking on Christopher Strachey during a British Computer Society Formal Aspects of Computing Science (BCS-FACS) evening seminar, London office, 15 November 2016
Born
Joseph E. Stoy

Education Oxford University
Known for Denotational semantics with Christopher Strachey
Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics
Bluespec, Inc.
SpouseGabrielle Stoy
Scientific career
Fields Computer science
Institutions Programming Research Group, Oxford University
MIT
Bluespec, Inc.

Joseph E. Stoy is a British computer scientist. He initially studied physics at Oxford University. Early in his career, in the 1970s, he worked on denotational semantics with Christopher Strachey in the Programming Research Group at the Oxford University Computing Laboratory (now the Oxford University Department of Computer Science). [1] He was a Fellow of Balliol College, Oxford. He has also spent time at the Massachusetts Institute of Technology (MIT) in the United States. [2]

In 2003, he co-founded Bluespec, Inc., a United States electronic design automation company. It provides a functional programming language named Bluespec SystemVerilog (BSV), a Haskell variant extended as a high-level hardware description language to design electronic chips.

His book Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics (MIT Press, 1977) is now a classic text. [3]

Stoy married Gabrielle Stoy, a mathematician and Fellow of Lady Margaret Hall, Oxford. [4]

Related Research Articles

<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.

In computer science, denotational semantics is an approach of formalizing the meanings of programming languages by constructing mathematical objects that describe the meanings of expressions from the languages. Other approaches providing formal semantics of programming languages include axiomatic semantics and operational semantics.

<span class="mw-page-title-main">Dana Scott</span> American logician (born 1932)

Dana Stewart Scott is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundations of modern approaches to the semantics of programming languages. He has also worked on modal logic, topology, and category theory.

<span class="mw-page-title-main">Programming Research Group</span> Department of the Oxford University Computing Laboratory

The Programming Research Group (PRG) was part of the Oxford University Computing Laboratory (OUCL) in Oxford, England, along with the Numerical Analysis Group, until OUCL became the Department of Computer Science in 2011.

<span class="mw-page-title-main">J. C. R. Licklider</span> American psychologist and computer scientist (1915-1990)

Joseph Carl Robnett Licklider, known simply as J. C. R. or "Lick", was an American psychologist and computer scientist who is considered to be among the most prominent figures in computer science development and general computing history.

In programming language theory, semantics is the rigorous mathematical study of the meaning of programming languages. Semantics assigns computational meaning to valid strings in a programming language syntax. It is closely related to, and often crosses over with, the semantics of mathematical proofs.

In computer science, a continuation is an abstract representation of the control state of a computer program. A continuation implements (reifies) the program control state, i.e. the continuation is a data structure that represents the computational process at a given point in the process's execution; the created data structure can be accessed by the programming language, instead of being hidden in the runtime environment. Continuations are useful for encoding other control mechanisms in programming languages such as exceptions, generators, coroutines, and so on.

<span class="mw-page-title-main">Peter Landin</span> British computer scientist (1930–2009)

Peter John Landin was a British computer scientist. He was one of the first to realise that the lambda calculus could be used to model a programming language, an insight that is essential to the development of both functional programming and denotational semantics.

<span class="mw-page-title-main">Samson Abramsky</span> British computer scientist

Samson Abramsky is Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at Wolfson College, Oxford, from 2000 to 2021.

<span class="mw-page-title-main">Christopher Strachey</span> British computer scientist (1916–1975)

Christopher S. Strachey was a British computer scientist. He was one of the founders of denotational semantics, and a pioneer in programming language design and computer time-sharing. He has also been credited as possibly being the first developer of a video game and for coining terms such as polymorphism and referential transparency that are still widely used by developers today. He was a member of the Strachey family, prominent in government, arts, administration, and academia.

<span class="mw-page-title-main">Joseph Goguen</span> American computer scientist

Joseph Amadee Goguen was an American computer scientist. He was professor of Computer Science at the University of California and University of Oxford, and held research positions at IBM and SRI International.

<span class="mw-page-title-main">Department of Computer Science, University of Oxford</span> Department of the University of Oxford

The Department of Computer Science is the computer science department of the University of Oxford, England, which is part of the university's Mathematical, Physical and Life Sciences Division. It was founded in 1957 as the Computing Laboratory. By 2014 the staff count was 52 members of academic staff and over 80 research staff. The 2019, 2020 and 2021 Times World University Subject Rankings places Oxford University 1st in the world for Computer Science. Oxford University is also the top university for computer science in the UK and Europe according to Business Insider. The 2020 QS University Subject Rankings places The University of Oxford 5th in the world for Computer Science.

In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while still guaranteeing that the request will eventually be serviced. Unbounded nondeterminism became an important issue in the development of the denotational semantics of concurrency, and later became part of research into the theoretical concept of hypercomputation.

<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.

In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations.

The denotational semantics of the Actor model is the subject of denotational domain theory for Actors. The historical development of this subject is recounted in [Hewitt 2008b].

<span class="mw-page-title-main">Programming language theory</span> Branch of computer science

Programming language theory (PLT) is a branch of computer science that deals with the design, implementation, analysis, characterization, and classification of formal languages known as programming languages. Programming language theory is closely related to other fields including mathematics, software engineering, and linguistics. There are a number of academic conferences and journals in the area.

Peter David Mosses is a British computer scientist.

<span class="mw-page-title-main">Yorick Wilks</span> British computer scientist (1939–2023)

Yorick Alexander Wilks FBCS was a British computer scientist. He was an emeritus professor of artificial intelligence at the University of Sheffield, visiting professor of artificial intelligence at Gresham College, senior research fellow at the Oxford Internet Institute, senior scientist at the Florida Institute for Human and Machine Cognition, and a member of the Epiphany Philosophers.

References

  1. Joe Stoy: Research interests, Oxford University Computing Laboratory, UK.
  2. "IFIP Working Group 2.3: Programming Methodology". News. Microsoft Research . Retrieved 8 November 2011.
  3. Joe Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics , MIT Press, 1981. (Paperback.) ISBN   978-0-262-69076-8.
  4. "Profile: Dr Gabrielle Stoy". Oxford, United Kingdom: Lady Margaret Hall, Oxford . Retrieved 17 November 2016.