1021 search results - page 8 / 205 » Pure Subtype Systems |
169
click to vote
TLCA
2007
Springer
16 years 14 days 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...
172
Voted
ICIW
2008
IEEE
16 years 24 days ago
2008
IEEE
Abstract—In this paper, we present Network Address Translator (NAT) traversal technique suitable for pure P2P applications, such as a distributed asynchronous Web-Based Training ...
187
Voted
FOSSACS
2008
Springer
15 years 8 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...
191
click to vote
CORR
2010
Springer
15 years 3 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...
204
Voted
IFIP
2004
Springer
15 years 11 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...