18 search results - page 2 / 4 » rta 2007 |
RTA
2007
Springer
13 years 11 months ago
2007
Springer
RTA
2007
Springer
13 years 11 months ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
RTA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
RTA
2007
Springer
13 years 11 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
RTA
2007
Springer
13 years 11 months ago
2007
Springer
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...