|
Thorsten Altenkirch
Thorsten Altenkirch ( , ) is a German Professor of Computer Science at the University of Nottingham known for his research on logic, type theory, and homotopy type theory. Altenkirch was part of the 2012/2013 special year on univalent foundations at the Institute for Advanced Study. At Nottingham he co-chairs the Functional Programming Laboratory with Graham Hutton. Education Altenkirch obtained his PhD from the University of Edinburgh in 1993 under Rod Burstall. Contributions Altenkirch's work includes: Containers A container is any receptacle or enclosure for holding a product used in storage, packaging, and transportation, including shipping. Things kept inside of a container are protected on several sides by being inside of its structure. The term ..., Epigram programming language, and Homotopy Type Theory: Univalent Foundations of Mathematics (''The HoTT Book''). Altenkirch has also been a guest on the YouTube channel Computerphile. References External links *A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Constructive Mathematics
In the philosophy of mathematics, constructivism asserts that it is necessary to find (or "construct") a specific example of a mathematical object in order to prove that an example exists. Contrastingly, in classical mathematics, one can prove the existence of a mathematical object without "finding" that object explicitly, by assuming its non-existence and then deriving a contradiction from that assumption. Such a proof by contradiction might be called non-constructive, and a constructivist might reject it. The constructive viewpoint involves a verificational interpretation of the existential quantifier, which is at odds with its classical interpretation. There are many forms of constructivism. These include the program of intuitionism founded by Brouwer, the finitism of Hilbert and Bernays, the constructive recursive mathematics of Shanin and Markov, and Bishop's program of constructive analysis. Constructivism also includes the study of constructive set theories such as CZF ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Univalent Foundations
Univalent foundations are an approach to the foundations of mathematics in which mathematical structures are built out of objects called ''types''. Types in univalent foundations do not correspond exactly to anything in set-theoretic foundations, but they may be thought of as spaces, with equal types corresponding to homotopy equivalent spaces and with equal elements of a type corresponding to points of a space connected by a path. Univalent foundations are inspired both by the old Platonic ideas of Hermann Grassmann and Georg Cantor and by " categorical" mathematics in the style of Alexander Grothendieck. Univalent foundations depart from the use of classical predicate logic as the underlying formal deduction system, replacing it, at the moment, with a version of Martin-Löf type theory. The development of univalent foundations is closely related to the development of homotopy type theory. Univalent foundations are compatible with structuralism, if an appropriate (i.e., categorica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alumni Of The University Of Edinburgh
This is a list of notable graduates as well as non-graduate former students, academic staff, and university officials of the University of Edinburgh in Scotland. It also includes those who may be considered alumni by extension, having studied at institutions that later merged with the University of Edinburgh. The university is associated with 19 Nobel Prize laureates, three Turing Award winners, an Abel Prize laureate and Fields Medallist, four Pulitzer Prize winners, three Prime Ministers of the United Kingdom, and several Olympic gold medallists. Government and politics Heads of state and government United Kingdom Cabinet and Party Leaders Scottish Cabinet and Party Leaders Current Members of the House of Commons * Wendy Chamberlain, MP for North East Fife * Joanna Cherry, MP for Edinburgh South West * Colin Clark, MP for Gordon * Anneliese Dodds, MP for Oxford East * Kate Green, MP for Stretford and Urmston * John Howell, MP for Henley * Neil Hud ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Year Of Birth Missing (living People)
A year or annus is the orbital period of a planetary body, for example, the Earth, moving in its orbit around the Sun. Due to the Earth's axial tilt, the course of a year sees the passing of the seasons, marked by change in weather, the hours of daylight, and, consequently, vegetation and soil fertility. In temperate and subpolar regions around the planet, four seasons are generally recognized: spring, summer, autumn and winter. In tropical and subtropical regions, several geographical sectors do not present defined seasons; but in the seasonal tropics, the annual wet and dry seasons are recognized and tracked. A calendar year is an approximation of the number of days of the Earth's orbital period, as counted in a given calendar. The Gregorian calendar, or modern calendar, presents its calendar year to be either a common year of 365 days or a leap year of 366 days, as do the Julian calendars. For the Gregorian calendar, the average length of the calenda ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
German Computer Scientists
German(s) may refer to: * Germany (of or related to) **Germania (historical use) * Germans, citizens of Germany, people of German ancestry, or native speakers of the German language ** For citizens of Germany, see also German nationality law **Germanic peoples (Roman times) * German language **any of the Germanic languages * German cuisine, traditional foods of Germany People * German (given name) * German (surname) * Germán, a Spanish name Places * German (parish), Isle of Man * German, Albania, or Gërmej * German, Bulgaria * German, Iran * German, North Macedonia * German, New York, U.S. * Agios Germanos, Greece Other uses * German (mythology), a South Slavic mythological being * Germans (band), a Canadian rock band * German (song), "German" (song), a 2019 song by No Money Enterprise * ''The German'', a 2008 short film * "The Germans", an episode of ''Fawlty Towers'' * ''The German'', a nickname for Congolese rebel André Kisase Ngandu See also * Germanic (disambi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Epigram (programming Language)
Epigram is a functional programming language with dependent types, and the integrated development environment (IDE) usually packaged with the language. Epigram's type system is strong enough to express program specifications. The goal is to support a smooth transition from ordinary programming to integrated programs and proofs whose correctness can be checked and certified by the compiler. Epigram exploits the ''Curry–Howard correspondence'', also termed the ''propositions as types principle'', and is based on intuitionistic type theory. The Epigram prototype was implemented by Conor McBride based on joint work with James McKinna. Its development is continued by the Epigram group in Nottingham, Durham, St Andrews, and Royal Holloway, University of London in the United Kingdom (UK). The current experimental implementation of the Epigram system is freely available together with a user manual, a tutorial and some background material. The system has been used under Linux, Windows, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Container (type Theory)
In type theory, containers are abstractions which permit various "collection types", such as lists and trees, to be represented in a uniform way. A ( unary) container is defined by a type of ''shapes'' S and a type family of ''positions'' P, indexed by S. The ''extension'' of a container is a family of dependent pairs consisting of a shape (of type S) and a function from positions of that shape to the element type. Containers can be seen as canonical forms for collection types. For lists, the shape type is the natural numbers (including zero). The corresponding position types are the types of natural numbers less than the shape, for each shape. For trees, the shape type is the type of trees of units (that is, trees with no information in them, just structure). The corresponding position types are isomorphic to the types of valid paths from the root to particular nodes on the shape, for each shape. Note that the natural numbers are isomorphic to lists of units. In general the shape ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homotopy Type Theory
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. This includes, among other lines of work, the construction of homotopical and Higher category theory, higher-categorical Model (mathematical logic), models for such type theories; the use of type theory as a logic (or internal language) for abstract homotopy theory and higher category theory; the development of mathematics within a type-theoretic foundation of mathematics, foundation (including both previously existing mathematics and new mathematics that homotopical types make possible); and the Formal proof, formalization of each of these in computer proof assistants. There is a large overlap between the work referred to as homotopy type theory, and as the univalent foundations project. Although neither is precisely delinea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Type Theory
In mathematics, logic, and computer science, a type theory is the formal presentation of a specific type system, and in general type theory is the academic study of type systems. Some type theories serve as alternatives to set theory as a foundation of mathematics. Two influential type theories that were proposed as foundations are Alonzo Church's typed λ-calculus and Per Martin-Löf's intuitionistic type theory. Most computerized proof-writing systems use a type theory for their foundation. A common one is Thierry Coquand's Calculus of Inductive Constructions. History Type theory was created to avoid a paradox in a mathematical foundation based on naive set theory and formal logic. Russell's paradox, which was discovered by Bertrand Russell, existed because a set could be defined using "all possible sets", which included itself. Between 1902 and 1908, Bertrand Russell proposed various "theories of type" to fix the problem. By 1908 Russell arrived at a "ramified" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Type Theory
In mathematics, logic, and computer science, a type theory is the formal presentation of a specific type system, and in general type theory is the academic study of type systems. Some type theories serve as alternatives to set theory as a foundation of mathematics. Two influential type theories that were proposed as foundations are Alonzo Church's typed λ-calculus and Per Martin-Löf's intuitionistic type theory. Most computerized proof-writing systems use a type theory for their foundation. A common one is Thierry Coquand's Calculus of Inductive Constructions. History Type theory was created to avoid a paradox in a mathematical foundation based on naive set theory and formal logic. Russell's paradox, which was discovered by Bertrand Russell, existed because a set could be defined using "all possible sets", which included itself. Between 1902 and 1908, Bertrand Russell proposed various "theories of type" to fix the problem. By 1908 Russell arrived at a "ramified" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Logic
Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and analysis. In the early 20th century it was shaped by David Hilbert's program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in proving consistency. Work in set theory sho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
