13383 search results - page 409 / 2677 » Abstractions from proofs |
153
click to vote
FOSSACS
2004
Springer
16 years 8 days ago
2004
Springer
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...
186
click to vote
ICALP
2004
Springer
16 years 8 days ago
2004
Springer
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a c...
259
click to vote
TACAS
2004
Springer
16 years 7 days ago
2004
Springer
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
166
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
173
click to vote
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
The notion of a bilattice was rst proposed by Ginsberg as a general framework for many applications. This notion was further investigated and applied for various goals by Fitting....