What is the translation of " TYPE THEORY " in Chinese?

• 类型理论
• type theory

Examples of using Type theory in English and their translations into Chinese

Main article: Type theory.
同义词条：Typetheory.

Type theory, basis for the study of type systems.
类型论（Typetheory），类型系统研究的基础.

Also, this personality type theory is interesting.
也，这个人格类型理论很有趣。

What type theory will replace quantum theory and relativity?
哪种理论结合了相对论与量子化学？?

The intersection of logic and type theory is a vast and active research area.
逻辑和类型论的交集是广阔和活跃的研究领域。

The design and study of type systems is known as type theory.
对型态系统的研究和设计被称为型态理论(typetheory)。

Anyway, enough type theory, let's check out some generic code.
不管怎样，类型理论已经足够充分,让我们看看一些通用的代码。

Some of the systems included in the cube were first defined in Automath. Homotopy type theory.
SomeofthesystemsincludedinthecubewerefirstdefinedinAutomath.同伦类型论.

In type theory lingo, it's called the empty type, because it has no values.
在类型理论术语中，它被称为emptytype，因为它没有值。

Any complete type, like i32, bool, or char is of kind*(this notation comes from the field of type theory).
任意的完全类型，如i32，bool，或char都是一种*类型（这种符号来自类型理论领域）。

In the context of type theory, such structures are called product types.
在类型论的背景下，这种结构被称为“产品类型”（producttypes）。

What's more, the constructivist mathematics that descended from Brouwer's ideas proved vital in the subsequent development of type theory.
更重要的是，起源于Brouwer想法的构造数学在随后的类型论发展中起了至关重要的作用。

Type theory has a natural deduction presentation in terms of formation, introduction and elimination rules;
类型论有使用形成、介入和除去规则的自然演绎表示；.

If every program can be reduced to a canonical form, then the type theory is said to be normalising(or weakly normalising).
如果每个程序都可以归约到规范形式，则这个类型论被成为是“规范化”的(或“弱规范化”的)。

Like logic, type theory has many extensions and variants, including first-order and higher-order versions.
象逻辑一样，类型论也有很多扩展和变体，包括一阶和高阶版本。

When you're designing a language with a sophisticated type system, it really helps a lot if you actually know something about type theory.
当你在设计一种具有深奥的类型系统的语言时，了解一些类型理论会非常的有帮助。

The difference between logic and type theory is primarily a shift of focus from the types(propositions) to the programs(proofs).
在逻辑和类型论之间的区别主要是把焦点从类型(命题)转移到了程序(证明)。

Seen as a programming language, Coq implements a dependently typed functional programming language, while seen as a logical system, it implements a higher-order type theory.
作为编程语言，Coq实现了一种依赖类型的函数式编程语言，作为逻辑系统，Coq实现了一个更高阶的类型理论。

An important result in computer science and type theory is that a type system corresponds to a particular logic system.
计算机科学领域中一个重要成就是：类型理论typetheory对应于一个特别的逻辑系统。

In type theory, the type of functions accepting values of type A and returning values of type B may be written as A→ B or BA.
对于类型论，函数类型接受值类型A并返回值类型B可写为A→B或BA。

In computer programming, especially functional programming and type theory, an algebraic data type is a kind of composite type, i.
在计算机编程、特别是函数式编程与类型理论中，代数数据类型(ADT)是一种组合类型(compositetype).

Modern type theory was invented partly in response to Russell's paradox, and features prominently in Russell and Whitehead's Principia Mathematica.
现代类型论在部分上是响应罗素悖论而发明的，并在伯特兰·罗素和阿弗烈·诺夫·怀海德的《数学原理》中起到重要作用。

Simply typed lambda calculus which is a higher-order logic; intuitionistic type theory; system F; LF is often used to define other type theories; calculus of constructions and its derivatives.
简单类型λ演算，一种高阶逻辑；直觉类型论；系统F;LF经常用来定义其他类型论；构造演算及其衍生理论。

Dependent type theory in full generality is very powerful: it is able to express almost any conceivable property of programs directly in the types of the program.
完全一般性的依赖类型论是非常强力的:它可以把几乎所有程序的可想象的性质直接表达为程序的类型。

In the 1980s, Per Martin-Löf developed intuitionistic type theory(also called constructive type theory), which associated functional programs with constructive proofs expressed as dependent types..
在20世纪80年代，PerMartin-Löf开发了intuitionistictypetheory（也称为constructivetypetheory），它将函数式编程与表现为类型依赖的数学证明联系起来。

Subtyping in type theory is characterized by the fact that any expression of type A may also be given type B if A<: B; the formal typing rule that codifies this is known as the subsumption rule.
在类型论中子类型可用如下事实来特征化，如果A<:B，类型A的任何表达式也可被给予类型B；立法这个特征化的形式类型规则叫做“包容”规则。

In programming languages and type theory, polymorphism is the provision of a single interface to entities of different types..
在编程语言和类型论中，多型（英语：polymorphism）指为不同数据类型的实体提供统一的接口。

Martin-Löf's intuitionistic type theory developed the notion of dependent types and directly influenced the development of the calculus of constructions and the logical framework LF.
马丁-洛夫开创的直觉类型论提出了依赖类型的概念，直接启发了构造演算（CoC）与LF逻辑框架的建立。

IF is often used to define other type theories;
LF经常用来定义其他类型论；.

Normalisability is a rare feature of most non-trivial type theories, which is a big departure from the logical world.
可规范化性是多数非平凡的类型论所稀有的特征，这是对逻辑世界的巨大违背。