Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01026719n
Noun Concept
JA
No term available
EN
In the branches of mathematical logic known as proof theory and type theory, a pure type system, previously known as a generalized type system, is a form of typed lambda calculus that allows an arbitrary number of sorts and dependencies between any of these. Wikipedia
Relations
Sources
IS A
型付きラムダ計算
HAS INSTANCE
EN
System U

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License