LICS
2010
IEEE
13 years 10 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 ...
ENTCS
2002
13 years 11 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
CORR
2010
Springer
13 years 11 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 ...
FOSSACS
2008
Springer
14 years 1 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...
BIRTHDAY
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
TLCA
2007
Springer
14 years 5 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...
POPL
2010
ACM
14 years 8 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
POPL
2003
ACM
14 years 11 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...