language:
Find link is a tool written by Edward Betts.Longer titles found: Type theory with records (view), Intuitionistic type theory (view), Homotopy type theory (view), Kind (type theory) (view), History of type theory (view), Container (type theory) (view), ST type theory (view)
searching for Type theory 35 found (710 total)
alternate case: type theory
Myers–Briggs Type Indicator
(9,480 words)
[view diff]
no match in snippet
view article
find links to article
The Myers–Briggs Type Indicator (MBTI) is a self-report questionnaire that makes pseudoscientific claims to categorize individuals into sixteen distinctBlood type personality theory (4,275 words) [view diff] exact match in snippet view article find links to article
personality. Davis, Matt (25 March 2019). "What is the Japanese blood type theory of personality?". Big Think. Retrieved 19 July 2020. Yamaguchi, MariType physicalism (2,321 words) [view diff] exact match in snippet view article find links to article
which the functionalist alludes. In this way we have a second order type theory". The fundamental point is that it is extremely difficult to determineOrdinal analysis (4,868 words) [view diff] exact match in snippet view article find links to article
comprehension. ATR0, arithmetical transfinite recursion. Martin-Löf type theory with arbitrarily many finite level universes. This ordinal is sometimesMap (higher-order function) (1,572 words) [view diff] no match in snippet view article
In many programming languages, map is a higher-order function that applies a given function to each element of a collection, e.g. a list or set, returningGrothendieck construction (964 words) [view diff] exact match in snippet view article find links to article
construction is used to model the relationship between a type theory and a logic over that type theory, and allows for the translation of concepts from indexedJournal of Functional Programming (212 words) [view diff] exact match in snippet view article find links to article
reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applicationsRank (198 words) [view diff] exact match in snippet view article find links to article
generated (or spanned) by a matrix's columns Rank (set theory) Rank (type theory) Rank of an abelian group, the cardinality of a maximal linearly independentPeter B. Andrews (315 words) [view diff] exact match in snippet view article find links to article
Transfinite Type Theory with Type Variables. North Holland Publishing Company, Amsterdam. Andrews, Peter B. (1971). "Resolution in type theory". JournalJohn G. Kemeny (1,174 words) [view diff] no match in snippet view article find links to article
mathematics in 1949 after completing a doctoral dissertation, titled "Type-theory vs. set-theory", also under the supervision of Alonzo Church. He workedNormalisation by evaluation (1,618 words) [view diff] exact match in snippet view article find links to article
approach, and to richer type systems such as several variants of Martin-Löf type theory. Consider the simply typed lambda calculus, where types τ can be basicUniversal Systems Language (770 words) [view diff] exact match in snippet view article find links to article
is equivalent to the process of deriving new types in a constructive type theory. The process of developing a software system with USL together with itsALF (proof assistant) (123 words) [view diff] exact match in snippet view article
logical framework") is a structure editor for monomorphic Martin-Löf type theory developed at Chalmers University. It is a predecessor of the Alfa, AgdaHugh Darwen (1,099 words) [view diff] exact match in snippet view article find links to article
Databases: The Third Manifesto: a detailed study of the impact of objects and type theory on the relational model of data including a comprehensive proposal forTotal functional programming (721 words) [view diff] exact match in snippet view article find links to article
paper. So could programming directly in plain System F, in Martin-Löf type theory or the Calculus of Constructions. Termination analysis This term is dueIdeal type (1,044 words) [view diff] exact match in snippet view article find links to article
law-seeking efforts. Critics of ideal type include proponents of the normal type theory. Some sociologists argue that ideal type tends to focus on extreme phenomenaAxiom of non-choice (698 words) [view diff] exact match in snippet view article find links to article
(anti-classical) in those theories. The axiom may also play a role in type theory, in particular when the theory is modeling a set theory. Arrow-theoreticClass (philosophy) (340 words) [view diff] exact match in snippet view article
of logic, and particularly Bertrand Russell"s Principia Mathematica "From Aristotle to EA: a type theory for EA" quoted 26/10/2014. Philosophy portalQ0 (mathematical logic) (1,135 words) [view diff] exact match in snippet view article
of infinity. Unlike many other formulations of type theory and proof assistants based on type theory, Q0 does not provide for base types other than oAugust Wilhelm von Hofmann (3,211 words) [view diff] exact match in snippet view article find links to article
Introduction to Modern Chemistry, summarising type theory and emerging ideas about chemical structure. Type theory modelled four inorganic molecules, hydrogenRuy de Queiroz (1,250 words) [view diff] exact match in snippet view article find links to article
late 1980s, Ruy de Queiroz has offered a reformulation of Martin-Löf type theory based on a novel reading of Wittgenstein’s "meaning-is-use", where theUnary numeral system (1,251 words) [view diff] exact match in snippet view article find links to article
Magaud, Nicolas; Bertot, Yves (2002), "Changing data structures in type theory: a study of natural numbers", Types for proofs and programs (Durham,Minimal logic (3,703 words) [view diff] no match in snippet view article find links to article
Minimal logic, or minimal calculus, is a symbolic logic system originally developed by Ingebrigt Johansson. It is an intuitionistic and paraconsistentGrammatical Framework (programming language) (1,779 words) [view diff] exact match in snippet view article
logical framework to be precise) based on Martin-Löf's intuitionistic type theory, with additional judgments tailored specifically to the domain of linguisticsFree variables and bound variables (2,227 words) [view diff] exact match in snippet view article find links to article
(2005). 978-0-88385-036-7 Thompson 1991, p. 33. Thompson, Simon (1991). Type theory and functional programming. Wokingham, England: Addison-Wesley. ISBN 0201416670Philippa Gardner (424 words) [view diff] case mismatch in snippet view article find links to article
PhD in 1992. Her doctoral thesis was titled "Representing Logics in Type Theory". After being awarded an EPSRC Advanced Fellowship at Cambridge UniversityKurt Gödel (5,484 words) [view diff] exact match in snippet view article find links to article
discovered a proof for the independence of the axiom of choice from finite type theory, a weakened form of set theory, while in Blue Hill in 1942. Gödel's closeOrder (mathematics) (503 words) [view diff] exact match in snippet view article
(graph theory) and bramble (graph theory) In logic, model theory and type theory: Zeroth-order logic First-order logic Second-order logic Higher-orderPaul Lorenzen (584 words) [view diff] exact match in snippet view article find links to article
protophysics of time and space. He developed constructive logic, constructive type theory and constructive analysis. Lorenzen's work on calculus Differential andKeirsey Temperament Sorter (1,410 words) [view diff] exact match in snippet view article find links to article
Kretschmer Five temperaments Four temperaments Socionics Temperament Type theory Keirsey, David (May 1, 1998) [1978]. Please Understand Me II: TemperamentRelational model (4,204 words) [view diff] exact match in snippet view article find links to article
database systems: the third manifesto; a detailed study of the impact of type theory on the relational model of data, including a comprehensive model of typeDivision by zero (5,697 words) [view diff] exact match in snippet view article find links to article
overridden setting (link) Buzzard, Kevin (5 Jul 2020), "Division by zero in type theory: a FAQ", Xena Project (Blog), retrieved 2024-01-21 Stutz, Michael (24Cartesian closed category (2,587 words) [view diff] exact match in snippet view article find links to article
001. Seely, R. A. G. (1984). "Locally cartesian closed categories and type theory". Mathematical Proceedings of the Cambridge Philosophical Society. 95Dialogical logic (5,226 words) [view diff] exact match in snippet view article find links to article
interpreted languages (as implemented within Per Martin-Löf's constructive type theory). The game-theoretical approach of Jaakko Hintikka, called GTS. ThisProof assistant (1,202 words) [view diff] case mismatch in snippet view article find links to article
(2013). "Calculating the Fundamental Group of the Circle in Homotopy Type Theory". 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science. pp