900 search results - page 2 / 180 » Pure Type Systems Formalized |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of the shape A : B, our systems just have judgments of the ...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
TLCA
2007
Springer
13 years 11 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...