207 search results - page 31 / 42 » Proof Systems and Transformation Games |
105
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
NAACL
2003
14 years 11 months ago
2003
Recent TREC results have demonstrated the need for deeper text understanding methods. This paper introduces the idea of automated reasoning applied to question answering and shows...
PEPM
2009
ACM
15 years 6 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
92
Voted
JFP
2000
14 years 9 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...