13383 search results - page 410 / 2677 » Abstractions from proofs |
171
click to vote
LFCS
1992
Springer
15 years 11 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
206
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
186
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
179
click to vote
POPL
1995
ACM
15 years 10 months ago
1995
ACM
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accep...
190
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...