645 search results - page 2 / 129 » Pure patterns type systems |
87
Voted
TLCA
2007
Springer
15 years 3 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...
89
Voted
FOSSACS
2008
Springer
14 years 11 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...
89
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
60
Voted
TLCA
1993
Springer
15 years 1 months ago
1993
Springer
POPL
2010
ACM
15 years 7 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)...