13306 search results - page 340 / 2662 » Theoretical Computer Science |
151
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
224
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
219
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
108
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
We describe performance enhancements that have been added to mkbTT, a modern completion tool combining multi-completion with the use of termination tools.
165
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...