3342 search results - page 364 / 669 » Automating Abstract Interpretation |
115
Voted
TPHOL
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
135
click to vote
TPHOL
2007
IEEE
15 years 11 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 ...
161
click to vote
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
123
click to vote
ECSQARU
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The issue of formalizing skepticism relations between argumentation semantics has been considered only recently in the literature. In this paper, we contribute to this ki...
129
Voted
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The Semantic Web Services initiatives are aiming to develop automatic and dynamic solutions for the semantically described Web services discovery, invocation and executio...