3228 search results - page 346 / 646 » Computationally Sound Proofs |
162
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...
125
click to vote
AFRICACRYPT
2008
Springer
15 years 10 months ago
2008
Springer
Public-key encryption schemes are a useful and interesting field of cryptographic study. The ultimate goal for the cryptographer in the field of public-key encryption would be th...
123
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
118
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
125
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...