Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Type theory

Known as: System of types, Typed logic, Type-theoretic 
In mathematics, logic, and computer science, a type theory is any of a class of formal systems, some of which can serve as alternatives to set theory… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour… Expand
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The intuitionistic modal logic of necessity is based on the judgmental notion of categorical truth. In this article we… Expand
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Dependent type theories have a long history of being used for theorem proving. One aspect of type theory which makes it very… Expand
  • figure 1.1
  • figure 2.2
  • figure 3.5
  • figure 3.7
  • figure 6.3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • Bart Jacobs
  • Studies in logic and the foundations of…
  • 1999
  • Corpus ID: 117187830
Chapter Headings only. Preface. Contents. Preliminaries. Prospectus. Introduction to fibred category theory. Simple type theory… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Introduction 1. The type-free lambda-calculus 2. Assigning types to terms 3. The principal-type algorithm 4. Type assignment with… Expand
  • figure 2
  • table 3E2
  • figure 8
  • figure 8A12
  • table 8B7
Is this relevant?
Highly Cited
1990
Highly Cited
1990
data type, 179 abstraction, 14 Abstraction rule, 143 absurdity, 43 append, 68 application, 13 Application rule, 143 apply, 48… Expand
  • figure 3.1
  • figure 15.1
  • figure 16.1
Is this relevant?
Highly Cited
1986
Highly Cited
1986
This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax… Expand
Is this relevant?
Highly Cited
1971
Highly Cited
1971
In [8] J. A. Robinson introduced a complete refutation pro­cedure called resolution for first order predicate calculus… Expand
Is this relevant?
Highly Cited
1950
Highly Cited
1950
The first order functional calculus was proved complete by Godel in 1930. Roughly speaking, this proof demonstrates that each… Expand
Is this relevant?
Highly Cited
1940
Highly Cited
1940
The purpose of the present paper is to give a formulation of the simple theory of types which incorporates certain features of… Expand
Is this relevant?