Robin Cockett

Last updated
Robin Cockett
Born (1952-05-04) May 4, 1952 (age 72)
Surrey, United Kingdom
Alma mater University of Warwick (BSc, 1974)
University of Leeds (PhD, 1979)
Scientific career
Fields Category theory
Quantum programming
Institutions University of Calgary
University of Tennessee
Thesis Injectives and Localizations in Category Theory  (1979)
Doctoral advisor Alfred Goldie

James Robin Bernard Cockett (born May 4, 1952) [1] is a British computer scientist and professor at the University of Calgary. [2]

Contents

Education

Cockett received his Bachelor of Science from the University of Warwick in 1974, [3] and earned his PhD from the University of Leeds in 1979 for his research in injectives and localizations in category theory, studying under Alfred Goldie. [4]

Career and research

Cockett has been a professor of computer science at the University of Calgary since 1991, previously holding the title of professor at the University of Tennessee. [5] [6]

Cockett works primarily in the fields of category theory, categorical programming, and quantum programming. [3] Cockett is a member of the organizing committee for the Foundational Methods in Computer Science (FMCS) conference, [3] an annual workshop for researchers in theoretical computer science and category theory supported by the Pacific Institute for the Mathematical Sciences (PIMS). [7]

Selected publications

His most cited publications [2] include:

Personal life

Cockett has been married to fellow University of Calgary professor Polly Knowlton Cockett since 1984, [13] they have three children together: Audrey Lane, Rowan, and Grayson. [14] Cockett is an avid cross-country skier, taking part in the Canadian Birkebeiner on more than one occasion, [15] [16] as well as volunteering as an instructor. [14]

Cockett and his wife have volunteered for numerous environmentally-focused initiatives, including as lecturers for the Calgary Parks Biodiversity Conservation program at Nose Hill Park, [14] and with the Alberta Wilderness Association, [14] where his family's work earned them an award from the city of Calgary. [14]

Related Research Articles

<span class="mw-page-title-main">Category theory</span> General theory of mathematical structures

Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory is used in almost all areas of mathematics. In particular, many constructions of new mathematical objects from previous ones that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality.

In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions, each taking a single argument.

<span class="mw-page-title-main">Discrete mathematics</span> Study of discrete mathematical structures

Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".

<span class="mw-page-title-main">Differential geometry</span> Branch of mathematics dealing with functions and geometric structures on differentiable manifolds

Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds. It uses the techniques of differential calculus, integral calculus, linear algebra and multilinear algebra. The field has its origins in the study of spherical geometry as far back as antiquity. It also relates to astronomy, the geodesy of the Earth, and later the study of hyperbolic geometry by Lobachevsky. The simplest examples of smooth spaces are the plane and space curves and surfaces in the three-dimensional Euclidean space, and the study of these shapes formed the basis for development of modern differential geometry during the 18th and 19th centuries.

In category theory, a category is Cartesian closed if, roughly speaking, any morphism defined on a product of two objects can be naturally identified with a morphism defined on one of the factors. These categories are particularly important in mathematical logic and the theory of programming, in that their internal language is the simply typed lambda calculus. They are generalized by closed monoidal categories, whose internal language, linear type systems, are suitable for both quantum and classical computation.

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.

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

Samson Abramsky is a British computer scientist who is a 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.

Categorical logic is the branch of mathematics in which tools and concepts from category theory are applied to the study of mathematical logic. It is also notable for its connections to theoretical computer science. In broad terms, categorical logic represents both syntax and semantics by a category, and an interpretation by a functor. The categorical framework provides a rich conceptual background for logical and type-theoretic constructions. The subject has been recognisable in these terms since around 1970.

<span class="mw-page-title-main">Joachim Lambek</span> Canadian mathematician (1922–2014)

Joachim "Jim" Lambek was a Canadian mathematician. He was Peter Redpath Emeritus Professor of Pure Mathematics at McGill University, where he earned his PhD degree in 1950 with Hans Zassenhaus as advisor.

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

In mathematics, a projection is an idempotent mapping of a set into a subset. In this case, idempotent means that projecting twice is the same as projecting once. The restriction to a subspace of a projection is also called a projection, even if the idempotence property is lost. An everyday example of a projection is the casting of shadows onto a plane : the projection of a point is its shadow on the sheet of paper, and the projection (shadow) of a point on the sheet of paper is that point itself (idempotency). The shadow of a three-dimensional sphere is a disk. Originally, the notion of projection was introduced in Euclidean geometry to denote the projection of the three-dimensional Euclidean space onto a plane in it, like the shadow example. The two main projections of this kind are:

<span class="mw-page-title-main">Martin Hyland</span> British mathematician

(John) Martin Elliott Hyland is professor of mathematical logic at the University of Cambridge and a fellow of King's College, Cambridge. His interests include mathematical logic, category theory, and theoretical computer science.

In mathematics, a category is distributive if it has finite products and finite coproducts and such that for every choice of objects , the canonical map

<span class="mw-page-title-main">Distributive law between monads</span>

In category theory, an abstract branch of mathematics, distributive laws between monads are a way to express abstractly that two algebraic structures distribute one over the other.

Categorical quantum mechanics is the study of quantum foundations and quantum information using paradigms from mathematics and computer science, notably monoidal category theory. The primitive objects of study are physical processes, and the different ways that these can be composed. It was pioneered in 2004 by Samson Abramsky and Bob Coecke. Categorical quantum mechanics is entry 18M40 in MSC2020.

<span class="mw-page-title-main">Homotopy type theory</span> Type theory in logic and mathematics

In mathematical logic and computer science, homotopy type theory (HoTT) refers to various lines of development of intuitionistic type theory, based on the interpretation of types as objects to which the intuition of (abstract) homotopy theory applies.

<span class="mw-page-title-main">William Hamilton Meeks, III</span> American mathematician

William Hamilton Meeks III is an American mathematician, specializing in differential geometry and minimal surfaces.

Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics, natural language processing, control theory, probability theory and causality. The application of category theory in these domains can take different forms. In some cases the formalization of the domain into the language of category theory is the goal, the idea here being that this would elucidate the important structure and properties of the domain. In other cases the formalization is used to leverage the power of abstraction in order to prove new results about the field.

In category theory, a rig category is a category equipped with two monoidal structures, one distributing over the other.

Jiří Rosický is a Czech mathematician. He works on the field of category theory. He is cited as one of the first researchers to introduce tangent categories and tangent bundle functors.

References

  1. ↑ "Index entry". FreeBMD. ONS. Retrieved 24 September 2023.
  2. 1 2 Robin Cockett publications indexed by Google Scholar
  3. 1 2 3 "ROBIN COCKETT". University of Calgary. Retrieved 24 September 2023.
  4. ↑ "James Robin Bernard Cockett". Mathematics Genealogy Project. Retrieved 24 September 2023.
  5. ↑ "55 UT Faculty Members Win Tennessee Tomorrow Grants". The Knoxville News-Sentinel. February 18, 1983. p. A5.
  6. ↑ L.E. Parker (1988). "A Robot Navigation Algorithm for Moving Obstacles". Master's Thesis. University of Tennessee: 2.
  7. ↑ "Foundational Methods in Computer Science". Pacific Institute for the Mathematical Sciences. Retrieved 24 September 2023.
  8. ↑ J.R.B. Cockett; R.A.G. Seely (January 13, 1997). "Weakly distributive categories". Journal of Pure and Applied Algebra. 114 (2): 133–173. doi:10.1017/CBO9780511525902.004.
  9. ↑ J.R.B. Cockett; Stephen Lack (January 6, 2002). "Restriction categories I: categories of partial maps". Theoretical Computer Science. 270 (1–2): 223–259. arXiv: math/0610500 . doi:10.1016/S0304-3975(00)00382-0. S2CID   12444870.
  10. ↑ R.F. Blute; J.R.B. Cockett; R.A.G. Seely (November 1, 2006). "Differential categories". Mathematical Structures in Computer Science. 16 (6): 1049–1083. doi:10.1017/S0960129506005676. S2CID   11818257.
  11. ↑ R.F. Blute; J.R.B. Cockett; R.A.G. Seely (December 10, 2009). "Cartesian differential categories" (PDF). Theory and Applications of Categories. 22 (23): 622–672.
  12. ↑ J.R.B. Cockett; G.S.H. Cruttwell (May 7, 2013). "Differential structure, tangent structure, and SDG". Applied Categorical Structures. 22 (2): 341–417. doi:10.1007/s10485-013-9312-0. S2CID   254230142.
  13. ↑ "ENGAGEMENTS". The Boston Globe. March 25, 1984. p. 84.
  14. 1 2 3 4 5 "15th ANNUAL LEADERSHIP AWARDS". Calgary Herald. April 21, 2011. p. N5.
  15. ↑ "CROSS-COUNTRY SKIING". Edmonton Journal. February 19, 2004. p. D5.
  16. ↑ "LOCAL CROSS-COUNTRY SKIING". Edmonton Journal. February 16, 2007. p. C7.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.