96 search results - page 16 / 20 » Analyzing recursive programs using a fixed-point calculus |
115
click to vote
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
101
click to vote
SAS
2001
Springer
15 years 6 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
118
click to vote
TLDI
2005
ACM
15 years 8 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
214
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
140
click to vote
ICFP
2007
ACM
16 years 2 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...