Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstract data typeAutomated proof checkingBounded quantifierBrouwer–Heyting–Kolmogorov interpretation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic
Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi… 
2011
2011
CONNECTIONS BETWEEN THE STABILITY OF A POINCARE MAP AND BOUNDEDNESS OF CERTAIN ASSOCIATE SEQUENCES
Let m ≥ 1 and N ≥ 2 be two natural numbers and let U = {U(p,q)}pq�0 be the N-periodic discrete evolution family of m × m matrices… 
2003
2003
On nonnegative entire solutions of second-order semilinear elliptic systems
We consider the second-order semilinear elliptic system ui = Pi(x)u i i+1 in R N , i = 1,2,...,m with nonnegative continuous… 
2003
2003
cl : A Language for Formally Defining Web Services Interactions
Web services have emerged recently as a distributed computing paradigm of choice for loosely-coupled computing. Current web… 
2001
2001
A Recipe for Raw Types
The design of GJ (Bracha, Odersky, Stoutamire and Wadler), an extension of Java with parametric polymorphism, was significantly… 
2001
2001
A Framework for Analysis of Typed Logic Programs
The paper presents a novel approach to the analysis of typed logic programs. We assume regular type descriptions of logic program… 
1994
1994
COMBINING TYPE CLASSES AND EXISTENTIAL TYPES
This paper demonstrates that the novel combination of type classes and existential types adds significant expressive power to a… 
1991
1991
How to Prove Higher Order Theorems in First Order Logic
In this paper we are interested in using a first order theorem prover to prove theorems that are formulated in some higher order… 
1972
1972
Bertrand Russell on his paradox and the multiplicative axiom. An unpublished letter to Philip Jourdain
1953
1953
On omega;-Inconsistency and a So-Called Axiom of Infinity
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)