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… (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- Simon J. Gay, Vasco Thudichum Vasconcelos
- J. Funct. Program.
- 2010

Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka
- ACM Trans. Comput. Log.
- 2008

The intuitionistic modal logic of necessity is based on the judgmental notion of categorical truth. In this article we… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Aleksandar Nanevski, J. Gregory Morrisett, Lars Birkedal
- J. Funct. Program.
- 2008

We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Frank Pfenning
- LICS
- 2001

We develop a uniform type theory that integrates intensionality, extensionality, and proof irrelevance as judgmental concepts… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Amokrane Saïbi
- POPL
- 1997

We propose and study a new typing algorithm for dependent type theory. This new algorithm typechecks more terms by using… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Michael Moortgat
- 1997

perspective, labels represent an extra `informational resource' which is present in deduction and can play a variety of roles… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Peter B. Andrews, Matthew Bishop, Sunil Issar, Daniel Nesmith, Frank Pfenning, Hongwei Xi
- Journal of Automated Reasoning
- 1996

This is description of TPS, a theorem-proving system for classical type theory (Church's typed λ-calculus). TPS has been designed… (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

0. Introduction. I t is well known that for much of the mathematics of topos theory, it is in fact sufficient to use a category C… (More)

Is this relevant?

Highly Cited

1940

Highly Cited

1940

- Alonzo Church
- J. Symb. Log.
- 1940

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)

Is this relevant?