4573 search results - page 617 / 915 » Automated Reasoning |
191
click to vote
TPHOL
2007
IEEE
16 years 1 months ago
2007
IEEE
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (`a la Huet, Nipkow and Shankar) is isomorphic to an α-quotiented ...
152
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
167
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
165
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
We give a fully abstract game model for Idealized Algol with non-local control flow. In contrast to most previous papers on game semantics, we do not need to include the bad-varia...
170
click to vote
ECSQARU
2007
Springer
16 years 1 months ago
2007
Springer
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...