|
Thierry Coquand (cropped)
Thierry Coquand (; born 18 April 1961 in Bourgoin-Jallieu, Isère, France) is a French computer scientist and mathematician who is currently a professor of computer science at the University of Gothenburg, having previously worked at INRIA. He is known for his work in constructive mathematics, especially the calculus of constructions. He received his Ph.D. under the supervision of Gérard Huet, another academic who has experience in both mathematics and computer science. According to the Association for Computing Machinery#Portal and Digital Library, ACM Digital Library, his first published article was a 1985 collaboration with Huet titled "Constructions: A Higher Order Proof System for Mechanizing Mathematics". Coquand and Huet published another joint article in September of that year which further expanded on their ideas regarding constructive mathematics. In the following year, 1986, Coquand published a noteworthy paper about Girard's paradox in the System U logic system. Since ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Thierry Coquand (cropped)
Thierry Coquand (; born 18 April 1961 in Bourgoin-Jallieu, Isère, France) is a French computer scientist and mathematician who is currently a professor of computer science at the University of Gothenburg, having previously worked at INRIA. He is known for his work in constructive mathematics, especially the calculus of constructions. He received his Ph.D. under the supervision of Gérard Huet, another academic who has experience in both mathematics and computer science. According to the Association for Computing Machinery#Portal and Digital Library, ACM Digital Library, his first published article was a 1985 collaboration with Huet titled "Constructions: A Higher Order Proof System for Mechanizing Mathematics". Coquand and Huet published another joint article in September of that year which further expanded on their ideas regarding constructive mathematics. In the following year, 1986, Coquand published a noteworthy paper about Girard's paradox in the System U logic system. Since ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Four Color Theorem
In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. ''Adjacent'' means that two regions share a common boundary curve segment, not merely a corner where three or more regions meet. It was the first major theorem to be proved using a computer. Initially, this proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand. The proof has gained wide acceptance since then, although some doubters remain. The four color theorem was proved in 1976 by Kenneth Appel and Wolfgang Haken after many false proofs and counterexamples (unlike the five color theorem, proved in the 1800s, which states that five colors are enough to color a map). To dispel any remaining doubts about the Appel–Haken proof, a simpler proof using the same ideas and still relying on computers was publi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Academic Staff Of The University Of Gothenburg
An academy (Attic Greek: Ἀκαδήμεια; Koine Greek Ἀκαδημία) is an institution of secondary or tertiary higher learning (and generally also research or honorary membership). The name traces back to Plato's school of philosophy, founded approximately 385 BC at Akademia, a sanctuary of Athena, the goddess of wisdom and skill, north of Athens, Greece. Etymology The word comes from the ''Academy'' in ancient Greece, which derives from the Athenian hero, ''Akademos''. Outside the city walls of Athens, the gymnasium was made famous by Plato as a center of learning. The sacred space, dedicated to the goddess of wisdom, Athena, had formerly been an olive grove, hence the expression "the groves of Academe". In these gardens, the philosopher Plato conversed with followers. Plato developed his sessions into a method of teaching philosophy and in 387 BC, established what is known today as the Old Academy. By extension, ''academia'' has come to mean the accumulation, dev ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
21st-century French Mathematicians
The 1st century was the century spanning AD 1 ( I) through AD 100 ( C) according to the Julian calendar. It is often written as the or to distinguish it from the 1st century BC (or BCE) which preceded it. The 1st century is considered part of the Classical era, epoch, or historical period. The 1st century also saw the appearance of Christianity. During this period, Europe, North Africa and the Near East fell under increasing domination by the Roman Empire, which continued expanding, most notably conquering Britain under the emperor Claudius ( AD 43). The reforms introduced by Augustus during his long reign stabilized the empire after the turmoil of the previous century's civil wars. Later in the century the Julio-Claudian dynasty, which had been founded by Augustus, came to an end with the suicide of Nero in AD 68. There followed the famous Year of Four Emperors, a brief period of civil war and instability, which was finally brought to an end by Vespasian, ninth Roman emper ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
École Normale Supérieure Alumni , a Japanese video-games developer/publisher
{{disambiguation, geo ...
École may refer to: * an elementary school in the French educational stages normally followed by secondary education establishments (collège and lycée) * École (river), a tributary of the Seine flowing in région Île-de-France * École, Savoie, a French commune * École-Valentin, a French commune in the Doubs département * Grandes écoles, higher education establishments in France * The École, a French-American bilingual school in New York City Ecole may refer to: * Ecole Software This is a list of Notability, notable video game companies that have made games for either computers (like PC or Mac), video game consoles, handheld or mobile devices, and includes companies that currently exist as well as now-defunct companies. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
French Computer Scientists
French (french: français(e), link=no) may refer to: * Something of, from, or related to France ** French language, which originated in France, and its various dialects and accents ** French people, a nation and ethnic group identified with France ** French cuisine, cooking traditions and practices Fortnite French places Arts and media * The French (band), a British rock band * "French" (episode), a live-action episode of ''The Super Mario Bros. Super Show!'' * ''Française'' (film), 2008 * French Stewart (born 1964), American actor Other uses * French (surname), a surname (including a list of people with the name) * French (tunic), a particular type of military jacket or tunic used in the Russian Empire and Soviet Union * French's, an American brand of mustard condiment * French catheter scale, a unit of measurement of diameter * French Defence, a chess opening * French kiss, a type of kiss involving the tongue See also * France (other) * Franch, a surname * Fren ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
System U
In mathematical logic, System U and System U− are pure type systems, i.e. special forms of a typed lambda calculus with an arbitrary number of sorts, axioms and rules (or dependencies between the sorts). They were both proved inconsistent by Jean-Yves Girard in 1972. This result led to the realization that Martin-Löf's original 1971 type theory was inconsistent as it allowed the same "Type in Type" behaviour that Girard's paradox exploits. Formal definition System U is defined as a pure type system with * three sorts \; * two axioms \; and * five rules \. System U− is defined the same with the exception of the (\triangle, \ast) rule. The sorts \ast and \square are conventionally called “Type” and “ Kind”, respectively; the sort \triangle doesn't have a specific name. The two axioms describe the containment of types in kinds (\ast:\square) and kinds in \triangle (\square:\triangle). Intuitively, the sorts describe a hierarchy in the ''nature'' of the terms. # A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
C (programming Language)
C (''pronounced like the letter c'') is a General-purpose language, general-purpose computer programming language. It was created in the 1970s by Dennis Ritchie, and remains very widely used and influential. By design, C's features cleanly reflect the capabilities of the targeted CPUs. It has found lasting use in operating systems, device drivers, protocol stacks, though decreasingly for application software. C is commonly used on computer architectures that range from the largest supercomputers to the smallest microcontrollers and embedded systems. A successor to the programming language B (programming language), B, C was originally developed at Bell Labs by Ritchie between 1972 and 1973 to construct utilities running on Unix. It was applied to re-implementing the kernel of the Unix operating system. During the 1980s, C gradually gained popularity. It has become one of the measuring programming language popularity, most widely used programming languages, with C compilers avail ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CompCert
CompCert is a formally verified optimizing compiler for a large subset of the C99 programming language (known as Clight) which currently targets PowerPC, ARM, RISC-V, x86 and x86-64 architectures. This project, led by Xavier Leroy, started officially in 2005, funded by the French institutes ANR and INRIA. The compiler is specified, programmed and proven in Coq. It aims to be used for programming embedded systems requiring reliability. The performance of its generated code is often close to that of GCC (version 3) at optimization level -O1, and always better than that of GCC without optimizations. Since 2015 AbsInt offers commercial licenses, provides support and maintenance, and contributes to the advancement of the tool. CompCert is released under a noncommercial license, and is therefore not free software, although some of its source files are dual-licensed with the GNU Lesser General Public License version 2.1 or later or are available under the terms of other license ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-surveyable Proof
In the philosophy of mathematics, a non-surveyable proof is a mathematical proof that is considered infeasible for a human mathematician to verify and so of controversial validity. The term was coined by Thomas Tymoczko in 1979 in criticism of Kenneth Appel and Wolfgang Haken's computer-assisted proof of the four color theorem, and has since been applied to other arguments, mainly those with excessive case splitting and/or with portions dispatched by a difficult-to-verify computer program. Surveyability remains an important consideration in computational mathematics. Tymoczko's argument Tymoczko argued that three criteria determine whether an argument is a mathematical proof: * ''Convincingness'', which refers to the proof's ability to persuade a rational prover of its conclusion; * ''Surveyability'', which refers to the proof's accessibility for verification by members of the human mathematical community; and * ''Formalizability'', which refers to the proof's appealing to onl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Thierry Coquand (cropped)")
