20813 search results - page 18 / 4163 » Introduction to Computer Networking |
IJNM
1998
14 years 11 months ago
1998
CJ
2010
14 years 9 months ago
2010
RTA
2007
Springer
15 years 5 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. ...
121
click to vote
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...