Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,834,137 papers from all fields of science
Search
Sign In
Create Free Account
History of type theory
Known as:
Simple theory of types
The type theory was initially created to avoid paradoxes in a variety of formal logics and rewrite systems. Later, type theory referred to a class of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Automath
Axiom of reducibility
Calculus of constructions
Curry–Howard correspondence
Expand
Broader (1)
Type theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A combinatorial result related to the consistency of New Foundations
A. Tzouvaras
Annals of Pure and Applied Logic
2011
Corpus ID: 1466562
2006
2006
Foundations of Intensional Semantics
Francis Jeffry Pelletier
Computational Linguistics
2006
Corpus ID: 9612282
If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and…
Expand
2005
2005
Fraenkel‐Carnap properties
G. Weaver
,
B. R. George
Mathematical Logic Quarterly
2005
Corpus ID: 32210198
In the 1920's Fraenkel and Carnap raised the question of whether or not every finitely axiomatizable semantically complete theory…
Expand
2002
2002
Knowledge Representation, Computation, and Learning in Higher-order Logic
J. Lloyd
2002
Corpus ID: 123364010
This paper contains a systematic study of the foundations of knowledge representation, computation, and learning in higher-order…
Expand
1992
1992
Logical Specifications for Functional Programs
T. Norvell
,
E. Hehner
International Conference on Mathematics of…
1992
Corpus ID: 46240075
We present a formal method of functional program development based on step-by-step transformation.
Highly Cited
1990
Highly Cited
1990
A Semi-Functional Implementation of a Higher-Order Logic Programming Language
Conal Elliott
,
F. Pfenning
1990
Corpus ID: 54154214
In this chapter we develop an interpreter of a higher-order constraint logic programming language in Standard ML (SML). The logic…
Expand
1981
1981
Applying simple theory of types to data bases
P. Materna
,
J. Pokorný
Information Systems
1981
Corpus ID: 39644595
1981
1981
Inequivalence of the fragments of new foundations
Ú. Oswald
Archive for Mathematical Logic
1981
Corpus ID: 719803
Grigin [2, 3] defined and investigated fragments of New Foundations (NF). Quine's [5] set theory N F is a first order theory in…
Expand
1977
1977
Data Types as Objects
A. Shamir
,
W. Wadge
International Colloquium on Automata, Languages…
1977
Corpus ID: 10974939
In this paper we present a new approach to the semantics of data types, in which the types themselves are incorporated as…
Expand
1948
1948
A problem concerning the notion of definability
A. Tarski
Journal of Symbolic Logic (JSL)
1948
Corpus ID: 40354166
We are inclined to believe that, by means of an argument entirely analogous to that which leads to the Richard antinomy, the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE